Abstract
The last few years have seen a significant growth in communication networks. This has resulted in a large variety 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 minimise the cost links to form a network by connecting a collection of terminals to a collection of concentrators. In this paper we consider artificial Ant Colonies to assign terminals to concentrators. The algorithms use an improvement method to locate the global minimum. An Ant Colony algorithm is a swam-based optimisation algorithm that mimics the natural behaviour of ants. We show that artificial Ant Colonies are able to achieve feasible solutions to Terminal Assignment instances, improving the results obtained by previous approaches.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Abuali, F., Schoenefeld, D., Wainwright, R.: Terminal assignment in a Communications Network Using Genetic Algorithms. In: Proc. of the 22nd Annual ACM Computer Science Conference, pp. 74–81. ACM Press, New York (1994)
Khuri, S., Chiu, T.: Heuristic Algorithms for the Terminal Assignment Problem. In: Proc. of the ACM Symposium on Applied Computing, pp. 247–251. ACM Press, New York (1997)
Salcedo-Sanz, S., Yao, X.: A hybrid Hopfield network-genetic algorithm approach for the terminal assignment problem. IEEE Transaction On Systems, Man and Cybernetics, 2343–2353 (2004)
Dorigo, M.: 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 (1991)
Dorigo, M., Maniezzo, V., Colorni, A.: Positive feedback as a search strategy. Technical Report 91-016, Dipartimento di Elettronica e Informazione, Politecnico di Milano, Italy (1991)
Dorigo, M., Maniezzo, V., Colorni, A.: The ant system: Optimization by a colony of cooperating agents. IEEE Transactions on Systems, Man, and Cybernetics 26, 29–41 (1996)
Ant Colony Optimization HomePage, http://iridia.ulb.ac.be/dorigo/ACO/ACO.html
Bernardino, E., Bernardino, A., Sánchez-Pérez, J., Vega-Rodríguez, M., Gómez-Pulido, J.: A Hybrid Ant Colony Optimization Algorithm for Solving the Terminal Assignment Problem. In: International Conference on Evolutionary Computation (2009)
Bernardino, E., Bernardino, A., Sánchez-Pérez, J., Vega-Rodríguez, M., Gómez-Pulido, J.: Tabu Search vs Hybrid Genetic Algorithm to solve the terminal assignment problem. In: IADIS International Conference Applied Computing, pp. 404–409. IADIS Press (2008)
Kennedy, J., Eberhart, R.C., Shi, Y.: Swarm intelligence. Morgan Kaufmann, San Francisco (2001)
Gambardella, L.M., Taillard, E.D., Dorigo, M.: Ant colonies for the quadratic assignment problem. Journal of the Operational Research Society 50(2), 167–176 (1999)
Glover, F.: Future paths for Integer Programming and Links to Artificial Intelligence. Computers and Operations Research 13(5), 533–549 (1986)
Glover, F., Laguna, M.: Tabu Search. Kluwer Academic Publishers, Norwell (1997)
Yao, X., Wang, F., Padmanabhan, K., Salcedo-Sanz, S.: 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 (2005)
Bernardino, E., Bernardino, A., Sánchez-Pérez, J., Vega-Rodríguez, M., Gómez-Pulido, J.: 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, Heidelberg (2009)
Xu, Y., Salcedo-Sanz, S., Yao, X.: Non-standard cost terminal assignment problems using tabu search approach. In: IEEE Conference in Evolutionary Computation, vol. 2, pp. 2302–2306 (2004)
Bernardino, E., Bernardino, A., Sánchez-Pérez, J., Vega-Rodríguez, M., Gómez-Pulido, J.: Solving the Terminal Assignment Problem Using a Local Search Genetic Algorithm. In: International Symposium on Distributed Computing and Artificial Intelligence, pp. 225–234. Springer, Heidelberg (2008)
Bernardino, E., Bernardino, A., Sánchez-Pérez, J., Vega-Rodríguez, M., Gómez-Pulido, J.: A Genetic Algorithm with Multiple Operators for Solving the Terminal Assignment Problem. In: Nguyen, N.T., Katarzyniak, R. (eds.) New Challenges in Applied Intelligence Technologies, pp. 279–288. Springer, Heidelberg (2008)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bernardino, E.M., Bernardino, A.M., Sánchez-Pérez, J.M., Gómez-Pulido, J.A., Vega-Rodríguez, M.A. (2011). Ant Colonies to Assign Terminals to Concentrators. In: Madani, K., Correia, A.D., Rosa, A., Filipe, J. (eds) Computational Intelligence. IJCCI 2009. Studies in Computational Intelligence, vol 343. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-20206-3_11
Download citation
DOI: https://doi.org/10.1007/978-3-642-20206-3_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-20205-6
Online ISBN: 978-3-642-20206-3
eBook Packages: EngineeringEngineering (R0)