Bernardino, Eugénia MoreiraBernardino, Anabela MoreiraSánchez-Pérez, Juan ManuelGómez-Pulido, Juan AntonioVega-Rodríguez, Miguel Angel2025-11-282025-11-282010-07E. M. Bernardino, A. M. Bernardino, J. M. Sánchez-Pérez, J. A. Gómez-Pulido and M. A. Vega-Rodríguez, "A Hybrid Scatter Search algorithm to assign terminals to concentrators," IEEE Congress on Evolutionary Computation, Barcelona, Spain, 2010, pp. 1-8, doi: https://doi.org/10.1109/CEC.2010.5586146.978-1-4244-6909-3978-1-4244-6911-6http://hdl.handle.net/10400.8/14797EISBN - 978-1-4244-6911-6Article number - 5586146; Conference name - 2010 6th IEEE World Congress on Computational Intelligence, WCCI 2010 - 2010 IEEE Congress on Evolutionary Computation, CEC 2010; Conference date - 18 July 2010 - 23 July 2010 Conference code - 85187The last few years have seen a significant growth in communication networks. With the growth of data traffic, network operators seek network-engineering tools to extract the maximum benefits out of the existing infrastructure. This has suggested a number of new optimisation problems, most of them in the field of combinatorial optimisation. We address here the Terminal Assignment problem. The main objective is to assign a collection of terminals to a collection of concentrators. In this paper, we propose a Hybrid Scatter Search (HSS) algorithm to assign terminals to concentrators. Coupled with the Scatter Search algorithm we use a Tabu Search algorithm to locate the global minimum. We show that HSS is able to achieve feasible solutions to Terminal Assignment instances, improving the results obtained by previous approaches.engOptimizationComputersAlgorithm design and analysisArtificial neural networksCommunication networksClassification algorithmsApproximation algorithmsconference paper10.1109/cec.2010.5586146