ABSTRACT
The changes that came with the development of telecommunication networks have increased some problems such as organization, transmission difficulties, location, and cost issues. In this scenario, the present work approaches the Ring Star Problem (RSP) applied to a ring star topology telecommunication network.With the objective of achieving the lowest net sums of the main ring cost and of the element assignment cost, it is used a heuristic algorithm based on the concepts of Greedy Randomized Adaptive Search Procedure (GRASP) and Iterated Local Search (ILS). Some experiments have been performed with a set of test problems in the literature and results have shown that the presented algorithm provides good solutions.
Keywords:
network project; heuristic; GRASP; ILS
