A hybrid ant colony optimization algorithm for solving the terminal assignment problem

Bernardino, Eugénia; Bernardino, Anabela; Sánchez-Pérez, Juan Manuel; Gómez-Pulido, Juan Antonio; Vega-Rodríguez, Miguel Angel

http://hdl.handle.net/10400.8/13059

Use this identifier to reference this record.

Name:	Description:	Size:	Format:
A hybrid ant colony optimization algorithm for solving the terminal assignment problem.pdf	The 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.	1.51 MB	Adobe PDF	Download

Send Feedback

Authors

Bernardino, Eugénia

Bernardino, Anabela

Sánchez-Pérez, Juan Manuel

Gómez-Pulido, Juan Antonio

Vega-Rodríguez, Miguel Angel

Abstract(s)

The 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.

Description

1st International Joint Conference on Computational Intelligence, IJCCI 2009, 5 October 2009 through 7 October 2009 - Code 81347

Keywords

Communication networks Optimization algorithms Ant colony optimization algorithm Terminal assignment problem

URI

http://hdl.handle.net/10400.8/13059

Citation

Bernardino, 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.