Reflexión académica sobre temáticas relacionadas con la Ingeniería

Ant Colony Optimization

Applications And Trends

Vol. 6 No. 10-11 (2010)
Published: 20-01-2011
Carlos Arturo Robles Algarín
Universidad Cooperativa de Colombia
Ants communicate through their pheromones; this is a substance that enables them to find the shortest path between their nest and food source. This feature has been used to solve optimization problems that
need to improve computation times substantially to solve a specific application. The ant colony optimization (
aco) is a meta-heuristic method based on the real behavior of ants. It consists of algorithms used to obtain
solutions to complex problems in a reasonable amount of computing time. The article presents a detailed description of the theory of ant colony optimization, afterwards, it performs a review of the algorithms
used in the aco and finally it shows various applications currently used to demonstrate the benefits of
aco in optimization algorithms. Likewise, it describes new theoretical developments and current trends in this
research field.
Keywords: colony, ants, optimization

How to Cite

[1]
C. A. Robles Algarín, “Ant Colony Optimization: Applications And Trends”, ing. Solidar, vol. 6, no. 10-11, pp. 83–89, Jan. 2011, Accessed: Mar. 22, 2026. [Online]. Available: https://revistas.ucc.edu.co/index.php/in/article/view/454

Alonso, S. et ál. (2004), La metaheurística de optimización basada en colonias de hormigas: modelos y nuevos

enfoques, Granada, Departamento de Ciencias de la Computacion e Inteligencia Artificial, e.t.s. Universidad

de Granada.

Barcos, L., Rodríguez, V. y Álvarez, M. J. (2004), Algoritmo basado en la optimización mediante colonias de hormigas para la resolución del problema del transporte de carga desde varios orígenes a varios destinos, Departamento de Organizacion Industrial Tecnun, Universidad de Navarra, Espana, V Congreso de Ingenieria del Transporte.

Bianchi, L. Gambardella, L. M. y Dorigo M, (2002), “An Ant Colony Optimization Approach to the Probabilistic Traveling Salesman Problem” [conferencia], ppsn-VII, Seventh International Conference on Parallel Problem Solving from Nature, Springer Verlag, Berlin.

Colorni, A., Dorigo, M. y Maniezzo, V. (1991), “Distributed Optimization by Ant Colonies, Proceedings of ecal’91” [conferencia], European Conference on Artificial Life, Elsevier Publishing, Amsterdam.

Colorni, A., Dorigo, M. y Maniezzo, V. (1992), “An investigation of some properties of an ‘ant algorithm’”

[conferencia], Memories Parallel Problem Solving from Nature Conference, Elsevier Publishing, Brucelas,

Belgica.

Dorigo, M. Gambardella, L. M. (1996), Ant Colony System: A Cooperative Learning Approach to the Traveling

Salesman Problem, Bruselas, Universite Libre de Bruxelles.

Dorigo, M., Maniezzo, V. y Colorni, A. (1996), “The Ant System: Optimization by a Colony of Cooperating

Agents”, ieee Transactions on Systems, Man, and Cybernetics, vol. 26, num. 1, pp. 1-13.

Dorigo, M. y Blum, C. (2005), “Ant Colony Optimization Theory: A Survey”, en Lecture Notes in Computer

Science, vol. 344, pp. 243-278.

Dorigo, M. (2004), “Ant colony optimization web page” [en línea], disponible en: http://iridia.ulb.

ac.be/~mdorigo/aco/aco.html, recuperado: 10 de marzo del 2010.

Maniezzo, V., Gambardella, L. M. y De Luigi, F. (2004), Ant Colony Optimization, Springer-Verlag, Berlin

Heidelberg, pp. 101-117.

Mendoza García, B. (2001), Uso del sistema de la colonia de hormigas para optimizar circuitos lógicos combinatorios [tesis de maestría], Veracruz, Universidad Veracruzana, Maestría en Inteligencia Artificial.

Muñoz, M., López, J. y Caicedo, E. (2007), Control inteligente usando optimización por colonia de hormigas,

Cali, Universidad del Valle.

Ponce, J., Padilla, F. y Ochoa, C. (2006), Algoritmo de optimización con colonia de hormigas para el problema

de la mochila, Mexico, Universidad Autonoma de Aguascalientes.

Reinelt, G. (1994), The traveling salesman: computational solutions for TSP applications, Berlin, Springer-Verlag.

MÉTRICAS
ARTICLE VIEWS: 4221
PDF VIEWS: 16321