Ant colony optimization: Introduction and recent trends

Abstract Ant colony optimization is a technique for optimization that was introduced in the early 1990's. The inspiring source of ant colony optimization is the foraging behavior of real ant colonies. This behavior is exploited in artificial ant colonies for the search of approximate solutions to discrete optimization problems, to continuous optimization problems, and to important problems in telecommunications, such as routing and load balancing. First, we deal with the biological inspiration of ant colony optimization algorithms. We show how this biological inspiration can be transfered into an algorithm for discrete optimization. Then, we outline ant colony optimization in more general terms in the context of discrete optimization, and present some of the nowadays best-performing ant colony optimization variants. After summarizing some important theoretical results, we demonstrate how ant colony optimization can be applied to continuous optimization problems. Finally, we provide examples of an interesting recent research direction: The hybridization with more classical techniques from artificial intelligence and operations research.

[1]  M. E. Muller,et al.  A Note on the Generation of Random Normal Deviates , 1958 .

[2]  Thomas Stützle,et al.  Stochastic Local Search: Foundations & Applications , 2004 .

[3]  Holger H. Hoos,et al.  An Ant Colony Optimization Algorithm for the 2D HP Protein Folding Problem , 2002, Ant Algorithms.

[4]  Luca Maria Gambardella,et al.  An Ant Colony System Hybridized with a New Local Search for the Sequential Ordering Problem , 2000, INFORMS J. Comput..

[5]  Matthew L. Ginsberg,et al.  Essentials of Artificial Intelligence , 2012 .

[6]  Ian C. Parmee,et al.  The Ant Colony Metaphor for Searching Continuous Design Spaces , 1995, Evolutionary Computing, AISB Workshop.

[7]  Roberto Tadei,et al.  Recovering Beam Search: Enhancing the Beam Search Approach for Combinatorial Optimization Problems , 2004, J. Heuristics.

[8]  Marco Dorigo,et al.  Search bias in ant colony optimization: on the role of competition-balanced systems , 2005, IEEE Transactions on Evolutionary Computation.

[9]  F. Glover,et al.  Handbook of Metaheuristics , 2019, International Series in Operations Research & Management Science.

[10]  Barbara Webb,et al.  Swarm Intelligence: From Natural to Artificial Systems , 2002, Connect. Sci..

[11]  Christian Blum,et al.  Theoretical and practical aspects of ant colony optimization , 2004 .

[12]  P. Ow,et al.  Filtered beam search in scheduling , 1988 .

[13]  Marc Gravel,et al.  Comparing an ACO algorithm with other heuristics for the single machine scheduling problem with sequence-dependent setup times , 2002, J. Oper. Res. Soc..

[14]  R. Unger,et al.  Finding the lowest free energy conformation of a protein is an NP-hard problem: proof and implications. , 1993, Bulletin of mathematical biology.

[15]  Nicolas Monmarché,et al.  Ants Can Play Music , 2004, ANTS Workshop.

[16]  Kenneth Steiglitz,et al.  Combinatorial Optimization: Algorithms and Complexity , 1981 .

[17]  Manuel López-Ibáñez,et al.  Ant colony optimization , 2010, GECCO '10.

[18]  Luca Maria Gambardella,et al.  MACS-VRPTW: a multiple ant colony system for vehicle routing problems with time windows , 1999 .

[19]  Colin G. Johnson,et al.  An ant colony algorithm for multiple sequence alignment in bioinformatics , 2003, ICANNGA.

[20]  Martin Middendorf,et al.  Pheromone Modification Strategies for Ant Algorithms Applied to Dynamic TSP , 2001, EvoWorkshops.

[21]  Vittorio Maniezzo,et al.  Exact and Approximate Nondeterministic Tree-Search Procedures for the Quadratic Assignment Problem , 1999, INFORMS J. Comput..

[22]  Guy Theraulaz,et al.  Dynamic Scheduling and Division of Labor in Social Insects , 2000, Adapt. Behav..

[23]  Luca Maria Gambardella,et al.  Solving symmetric and asymmetric TSPs by ant colonies , 1996, Proceedings of IEEE International Conference on Evolutionary Computation.

[24]  Nicolas Monmarché,et al.  On how Pachycondyla apicalis ants suggest a new search algorithm , 2000, Future Gener. Comput. Syst..

[25]  Marco Dorigo,et al.  The hyper-cube framework for ant colony optimization , 2004, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[26]  Baldo Faieta,et al.  Diversity and adaptation in populations of clustering ants , 1994 .

[27]  Jurij Silc,et al.  Mesh-Partitioning with the Multiple Ant-Colony Algorithm , 2004, ANTS Workshop.

[28]  Thomas Stützle,et al.  On the Design of ACO for the Biobjective Quadratic Assignment Problem , 2004, ANTS Workshop.

[29]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[30]  Christine Solnon,et al.  Ants can solve constraint satisfaction problems , 2002, IEEE Trans. Evol. Comput..

[31]  Marco Dorigo,et al.  Ant-Based Clustering and Topographic Mapping , 2006, Artificial Life.

[32]  M. Dorigo,et al.  1 Positive Feedback as a Search Strategy , 1991 .

[33]  Richard F. Hartl,et al.  Pareto Ant Colony Optimization: A Metaheuristic Approach to Multiobjective Portfolio Selection , 2004, Ann. Oper. Res..

[34]  Martin Middendorf,et al.  Modeling the Dynamics of Ant Colony Optimization , 2002, Evolutionary Computation.

[35]  Thang Nguyen Bui,et al.  Finding Maximum Cliques with Distributed Ants , 2004, GECCO.

[36]  Matthijs den Besten,et al.  Ant Colony Optimization for the Total Weighted Tardiness Problem , 2000, PPSN.

[37]  Thomas Stützle,et al.  An Ant Approach to the Flow Shop Problem , 1998 .

[38]  Fred W. Glover,et al.  Future paths for integer programming and links to artificial intelligence , 1986, Comput. Oper. Res..

[39]  Thomas Stützle,et al.  MAX-MIN Ant System , 2000, Future Gener. Comput. Syst..

[41]  Walter J. Gutjahr,et al.  A Graph-based Ant System and its convergence , 2000, Future Gener. Comput. Syst..

[42]  Hartmut Schmeck,et al.  Ant colony optimization for resource-constrained project scheduling , 2000, IEEE Trans. Evol. Comput..

[43]  Marco Dorigo,et al.  Ant colony optimization theory: A survey , 2005, Theor. Comput. Sci..

[44]  Christian Blum,et al.  Metaheuristics in combinatorial optimization: Overview and conceptual comparison , 2003, CSUR.

[45]  Luca Maria Gambardella,et al.  Ant Algorithms for Discrete Optimization , 1999, Artificial Life.

[46]  Chris Walshaw,et al.  A Multilevel Approach to the Travelling Salesman Problem , 2002, Oper. Res..

[47]  Thomas Stützle,et al.  A short convergence proof for a class of ant colony optimization algorithms , 2002, IEEE Trans. Evol. Comput..

[48]  François E. Cellier,et al.  Artificial Neural Networks and Genetic Algorithms , 1991 .

[49]  Vincent T'Kindt,et al.  An Ant Colony Optimisation Algorithm for the Set Packing Problem , 2004, ANTS Workshop.

[50]  Alain Hertz,et al.  Ants can colour graphs , 1997 .

[51]  Marco Dorigo,et al.  Ant Colony Optimization and Stochastic Gradient Descent , 2002, Artificial Life.

[52]  Marco Dorigo,et al.  Optimization, Learning and Natural Algorithms , 1992 .

[53]  Mauro Birattari,et al.  Model-Based Search for Combinatorial Optimization: A Critical Survey , 2004, Ann. Oper. Res..

[54]  Cees Duin,et al.  The pilot method: A strategy for heuristic repetition with application to the Steiner problem in graphs , 1999, Networks.

[55]  Luca Maria Gambardella,et al.  Ant colony system: a cooperative learning approach to the traveling salesman problem , 1997, IEEE Trans. Evol. Comput..

[56]  Joaquín Bautista,et al.  Ant Algorithms for Assembly Line Balancing , 2002, Ant Algorithms.

[57]  Luca Maria Gambardella,et al.  An Ant Colony Optimization Approach to the Probabilistic Traveling Salesman Problem , 2002, PPSN.

[58]  Karin M. Verspoor,et al.  Protein annotation as term categorization in the gene ontology using word proximity networks , 2005, BMC Bioinformatics.

[59]  Marco Dorigo,et al.  Ant system: optimization by a colony of cooperating agents , 1996, IEEE Trans. Syst. Man Cybern. Part B.

[60]  John N. Tsitsiklis,et al.  Rollout Algorithms for Combinatorial Optimization , 1997, J. Heuristics.

[61]  Riccardo Poli,et al.  New ideas in optimization , 1999 .

[62]  Jurij Silc,et al.  Solving the mesh-partitioning problem with an ant-colony algorithm , 2004, Parallel Comput..

[63]  Michael Sampels,et al.  Ant Algorithms for the University Course Timetabling Problem with Regard to the State-of-the-Art , 2003, EvoWorkshops.

[64]  Srinivas Katkoori,et al.  Ant colony system application to macrocell overlap removal , 2004, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.

[65]  Christian Blum,et al.  Training feed-forward neural networks with ant colony optimization: an application to pattern classification , 2005, Fifth International Conference on Hybrid Intelligent Systems (HIS'05).

[66]  Christian Blum,et al.  Combining Ant Colony Optimization with Dynamic Programming for Solving the k-Cardinality Tree Problem , 2005, IWANN.

[67]  Christian Blum,et al.  Beam-ACO - hybridizing ant colony optimization with beam search: an application to open shop scheduling , 2005, Comput. Oper. Res..

[68]  Chris Walshaw,et al.  Mesh Partitioning: A Multilevel Balancing and Refinement Algorithm , 2000, SIAM J. Sci. Comput..

[69]  Vittorio Maniezzo,et al.  An Ant-Based Framework for Very Strongly Constrained Problems , 2002, Ant Algorithms.

[70]  Andreas T. Ernst,et al.  Integrating ACO and Constraint Propagation , 2004, ANTS Workshop.

[71]  Christine Solnon,et al.  A Study of Greedy, Local Search, and Ant Colony Optimization Approaches for Car Sequencing Problems , 2003, EvoWorkshops.

[72]  F. Glover,et al.  In Modern Heuristic Techniques for Combinatorial Problems , 1993 .

[73]  Daniel Merkle,et al.  Modelling ACO: Composed Permutation Problems , 2002, Ant Algorithms.

[74]  Alex Alves Freitas,et al.  Data mining with an ant colony optimization algorithm , 2002, IEEE Trans. Evol. Comput..

[75]  Holger H. Hoos,et al.  An ant colony optimisation algorithm for the 2D and 3D hydrophobic polar protein folding problem , 2005, BMC Bioinformatics.

[76]  Márk Jelasity,et al.  An Ant Approach to Membership Overlay Design , 2004, ANTS Workshop.

[77]  Thomas A. Runkler,et al.  Ant Colonies as Logistic Processes Optimizers , 2002, Ant Algorithms.

[78]  Christian Blum,et al.  An Ant Colony Optimization Algorithm for Shop Scheduling Problems , 2004, J. Math. Model. Algorithms.

[79]  Riccardo Poli,et al.  Particle swarm optimization , 1995, Swarm Intelligence.

[80]  Thomas Stützle,et al.  A SHORT CONVERGENCE PROOF FOR A CLASS OF ACO ALGORITHMS , 2002 .

[81]  Johann Dréo,et al.  A New Ant Colony Algorithm Using the Heterarchical Concept Aimed at Optimization of Multiminima Continuous Functions , 2002, Ant Algorithms.

[82]  Marco Dorigo,et al.  AntNet: Distributed Stigmergetic Control for Communications Networks , 1998, J. Artif. Intell. Res..

[83]  Krzysztof Socha,et al.  ACO for Continuous and Mixed-Variable Optimization , 2004, ANTS Workshop.

[84]  Jianming Shi,et al.  Prediction of MHC class II binders using the ant colony search strategy , 2005, Artif. Intell. Medicine.

[85]  B. Bullnheimer,et al.  A NEW RANK BASED VERSION OF THE ANT SYSTEM: A COMPUTATIONAL STUDY , 1997 .

[86]  Walter J. Gutjahr,et al.  ACO algorithms with guaranteed convergence to the optimal solution , 2002, Inf. Process. Lett..

[87]  Vittorio Maniezzo,et al.  The Ant System Applied to the Quadratic Assignment Problem , 1999, IEEE Trans. Knowl. Data Eng..

[88]  G. Theraulaz,et al.  Inspiration for optimization from social insect behaviour , 2000, Nature.

[89]  Chris Walshaw,et al.  Multilevel Refinement for Combinatorial Optimisation Problems , 2004, Ann. Oper. Res..

[90]  Blum,et al.  [IEEE Fifth International Conference on Hybrid Intelligent Systems (HIS\'05) - Rio de Janeiro, Brazil (2005.11.6-2005.11.9)] Fifth International Conference on Hybrid Intelligent Systems (HIS\'05) - Training feed-forward neural networks with ant colony optimization: an application to pattern classifi , 2005 .

[91]  Martin Middendorf,et al.  An Island Model Based Ant System with Lookahead for the Shortest Supersequence Problem , 1998, PPSN.

[92]  Christian Blum,et al.  Ant Colony Optimization for the Maximum Edge-Disjoint Paths Problem , 2004, EvoWorkshops.

[93]  Mauro Birattari,et al.  Toward the Formal Foundation of Ant Programming , 2002, Ant Algorithms.

[94]  Erhan Kozan,et al.  Ant Colony Optimisation for Machine Layout Problems , 2004, Comput. Optim. Appl..

[95]  P.-P. Grasse.  La reconstruction du nid et les coordinations interindividuelles chezBellicositermes natalensis etCubitermes sp. la théorie de la stigmergie: Essai d'interprétation du comportement des termites constructeurs , 1959, Insectes Sociaux.

[96]  J. Deneubourg,et al.  The self-organizing exploratory pattern of the argentine ant , 1990, Journal of Insect Behavior.

[97]  Richard F. Hartl,et al.  D-Ants: Savings Based Ants divide and conquer the vehicle routing problem , 2004, Comput. Oper. Res..