Bernardino, EugéniaBernardino, AnabelaSánchez-Pérez, Juan ManuelGómez-Pulido, Juan AntonioVega-Rodríguez, Miguel Angel2025-06-022025-06-022009-10Bernardino, E. M., Bernardino, A. M., Sánchez-Pérez, J. M., Pulido, J. A. G., & Vega-Rodríguez, M. A. (2009, October). A hybrid ant colony optimization algorithm for solving the terminal assignment problem. In International Conference on Evolutionary Computation (Vol. 2, pp. 144-151). SCITEPRESS. DOI: https://doi.org/10.5220/0002322001440151.978-989674014-6http://hdl.handle.net/10400.8/130591st International Joint Conference on Computational Intelligence, IJCCI 2009, 5 October 2009 through 7 October 2009 - Code 81347The past two decades have witnessed tremendous research activities in optimization methods for communication networks. One important problem in communication networks is the Terminal Assignment Problem. This problem involves determining minimum cost links to form a network by connecting a collection of terminals to a collection of concentrators. In this paper, we propose a Hybrid Ant Colony Optimization Algorithm to solve the Terminal Assignment Problem. We compare our results with the results obtained by the standard Genetic Algorithm, the Tabu Search Algorithm and the Hybrid Differential Evolution Algorithm, used in literature.engCommunication networksOptimization algorithmsAnt colony optimization algorithmTerminal assignment problemconference paper10.5220/0002322001440151