A Grasp Heuristic for Solving an Extended Capacitated Concentrator Location Problem

Abstract

Local Access Networks (LACNs) are often considered the "last mile" over the Internet provided that they are connected to some existing Wide Area Network backbone. In this paper, a revised LACN-WAN interconnection model is presented as an extension to the conventional Capacitated Concentrator Location Problem (CCLP). An efficient heuristic is also developed to seek near-optimal deployment of telecommunication devices (e.g. links, concentrators, etc.) while minimizing the total connection costs for the network interconnection. Our solution algorithm could serve as a decision-making tool in solving problems with a real world size (i.e. 120 nodes and 30 concentrators).

Grasp: Greedy Randomized Adaptive Search Procedures

“…The first application of GRASP described in the literature concerned the set covering problem [46]. GRASP has been applied to many problems in different areas, such as routing [18,34,78,107]; logic [38,52,100,111,115,116]; covering and partitioning [12,17,46,62]; location [1,32,35,63,73,37,76,141]; minimum Steiner tree [31,87,88,91,131]; optimization in graphs [2,3,4,20,48,53,54,74,79,82,85,88,102,109,112,117,126,131,139]; assignment [5,7,…”