A HYBRID ANT COLONY OPTIMIZATION ALGORITHM FOR SOLVING THE TERMINAL ASSIGNMENT PROBLEM

Eugénia Moreira Bernardino, Anabela Moreira Bernardino, Juan Manuel Sánchez-Pérez, Juan Antonio Gomez Pulido, Miguel Ángel Vega-Rodríguez

Abstract

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.

References

  1. Abuali, F., Schoenefeld, D., Wainwright, R., 1994. Terminal assignment in a Communications Network Using Genetic Algorithms. In Proc. of the 22nd Annual ACM Computer Science Conference, pp. 74- 81. ACM Press.
  2. Bernardino, E., Bernardino, A., Sánchez-Pérez, J., VegaRodríguez, M., Gómez-Pulido, J., 2008. Tabu Search vs Hybrid Genetic Algorithm to solve the terminal assignment problem. In IADIS International Conference Applied Computing, pp. 404-409. IADIS Press.
  3. Bernardino, E., Bernardino, A., Sánchez-Pérez, J., VegaRodríguez, M., Gómez-Pulido, J., 2009. A Hybrid Differential Evolution Algorithm for solving the Terminal assignment problem. In International Symposium on Distributed Computing and Artificial Intelligence 2009, pp. 178-185. Springer.
  4. Dorigo, M., 1991. Ottimizzazione, apprendimento automatico, ed algoritmi basati su metafora naturale (Optimisation, learning and natural algorithms). Doctoral dissertation, Dipartimento di Elettronica e Informazione, Politecnico di Milano, Italy.
  5. Dorigo, M., Maniezzo, V., Colorni, A. 1991. Positive feedback as a search strategy. Technical Report 91- 016, Dipartimento di Elettronica e Informazione, Politecnico di Milano, Italy.
  6. Dorigo, M., Maniezzo, V., Colorni, A., 1996. The ant system: Optimization by a colony of cooperating agents. IEEE Transactions on Systems, Man, and Cybernetics. 26, 29-41.
  7. Gambardella, L. M., Taillard, E. D., and Dorigo, M., 1999 Ant colonies for the quadratic assignment problem. Journal of the Operational Research Society, 50(2), 167-176.
  8. Khuri, S., Chiu, T., 1997. Heuristic Algorithms for the Terminal Assignment Problem. In Proc. of the ACM Symposium on Applied Computing, pp. 247-251. ACM Press.
  9. Salcedo-Sanz, S., Yao, X., 2004. A hybrid Hopfield network-genetic algorithm approach for the terminal assignment problem. IEEE Transaction On Systems, Man and Cybernetics, 2343-2353.
  10. Xu, Y., Salcedo-Sanz, S., Yao, X. 2004 Non-standard cost terminal assignment problems using tabu search approach. In IEEE Conference in Evolutionary Computation, vol. 2, pp. 2302-2306.
  11. Yao, X., Wang, F., Padmanabhan, K., Salcedo-Sanz, S., 2005. Hybrid evolutionary approaches to terminal assignment in communications networks. In Recent Advances in Memetic Algorithms and related search technologies, vol. 166, pp. 129-159. Springer, Berlin.
Download


Paper Citation


in Harvard Style

Moreira Bernardino E., Moreira Bernardino A., Manuel Sánchez-Pérez J., Antonio Gomez Pulido J. and Ángel Vega-Rodríguez M. (2009). A HYBRID ANT COLONY OPTIMIZATION ALGORITHM FOR SOLVING THE TERMINAL ASSIGNMENT PROBLEM . In Proceedings of the International Joint Conference on Computational Intelligence - Volume 1: ICEC, (IJCCI 2009) ISBN 978-989-674-014-6, pages 144-151. DOI: 10.5220/0002322001440151


in Bibtex Style

@conference{icec09,
author={Eugénia Moreira Bernardino and Anabela Moreira Bernardino and Juan Manuel Sánchez-Pérez and Juan Antonio Gomez Pulido and Miguel Ángel Vega-Rodríguez},
title={A HYBRID ANT COLONY OPTIMIZATION ALGORITHM FOR SOLVING THE TERMINAL ASSIGNMENT PROBLEM},
booktitle={Proceedings of the International Joint Conference on Computational Intelligence - Volume 1: ICEC, (IJCCI 2009)},
year={2009},
pages={144-151},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0002322001440151},
isbn={978-989-674-014-6},
}


in EndNote Style

TY - CONF
JO - Proceedings of the International Joint Conference on Computational Intelligence - Volume 1: ICEC, (IJCCI 2009)
TI - A HYBRID ANT COLONY OPTIMIZATION ALGORITHM FOR SOLVING THE TERMINAL ASSIGNMENT PROBLEM
SN - 978-989-674-014-6
AU - Moreira Bernardino E.
AU - Moreira Bernardino A.
AU - Manuel Sánchez-Pérez J.
AU - Antonio Gomez Pulido J.
AU - Ángel Vega-Rodríguez M.
PY - 2009
SP - 144
EP - 151
DO - 10.5220/0002322001440151