Paper Title
Harmony Search Algorithm For Internet Network Design Problem

The internet network design model in this study considers the location of access points, the installation of wire, and the augmentation of signal over the constructed network in such a way that the total cost is minimized. The model is formulated as a mixed integer programming. The formulation is an arc-based capacitated multi-commodity network design problem with distant constraints and the location of access points at nodes. To efficiently solve this model, an algorithm is developed and experimented using meta-heuristic Harmony Search. The results show that the algorithm can solve large size instances to near optimality within a short period of time. A detailed study is also conducted on harmony search parameters to observe the impact on the overall algorithmic performance. Index Terms- Harmony search, Internet mesh network, Multi-commodity network, Optimization.