The Ant Colony Optimization Metaheuristic: Algorithms, Applications, and Advances

The field of ACO algorithms is very lively, as testified, for example, by the successful biannual workshop (ANTS—From Ant Colonies to Artificial Ants: A Series of International Workshops on Ant Algorithms; http://iridia.ulb.ac.be/~ants/) where researchers meet to discuss the properties of ACO and other ant algorithms, both theoretically and experimentally.

[1]  Marco Dorigo,et al.  Distributed Optimization by Ant Colonies , 1992 .

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

[3]  Wolfgang Domschke,et al.  Operations Research Proceedings 1999 , 2000 .

[4]  J. Deneubourg,et al.  Self-organized shortcuts in the Argentine ant , 1989, Naturwissenschaften.

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

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

[7]  Franz Oppacher,et al.  Connection Management using Adaptive Mobile Agents , 1998 .

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

[9]  E. Bonabeau,et al.  Routing in Telecommunications Networks with “ Smart ” Ant-Like Agents , 1998 .

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

[11]  Francisco Herrera,et al.  A New ACO Model Integrating Evolutionary Computation Concepts: The Best-Worst Ant System , 2000 .

[12]  Corso Elvezia,et al.  Ant colonies for the traveling salesman problem , 1997 .

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

[14]  Saul I. Gass,et al.  Encyclopedia of Operations Research and Management Science , 1997 .

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

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

[17]  Thomas Stützle,et al.  Parallelization Strategies for Ant Colony Optimization , 1998, PPSN.

[18]  Mauro Birattari,et al.  Updating ACO Pheromones Using Stochastic Gradient Ascent and Cross-Entropy Methods , 2002, EvoWorkshops.

[19]  Marco Dorigo,et al.  Two Ant Colony Algorithms for Best-Effort Routing in Datagram Networks , 1998 .

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

[21]  Devika Subramanian,et al.  Ants and Reinforcement Learning: A Case Study in Routing in Dynamic Networks , 1997, IJCAI.

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

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

[24]  M Dorigo,et al.  Ant colonies for the quadratic assignment problem , 1999, J. Oper. Res. Soc..

[25]  Thomas Stützle,et al.  ACO algorithms for the quadratic assignment problem , 1999 .

[26]  Yves Crama,et al.  Local Search in Combinatorial Optimization , 2018, Artificial Neural Networks.

[27]  Janet Bruten,et al.  Ant-like agents for load balancing in telecommunications networks , 1997, AGENTS '97.

[28]  E. Bonabeau,et al.  Swarm smarts. , 2000, Scientific American.

[29]  Mauricio G. C. Resende,et al.  Greedy Randomized Adaptive Search Procedures , 1995, J. Glob. Optim..

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

[31]  Matthijs den Besten,et al.  An Ant Colony Optimization Application to the Single Machine Total Weighted Tardiness Problem , 2000 .

[32]  G. Reinelt.  The traveling salesman: computational solutions for TSP applications , 1994 .

[33]  Marco Dorigo,et al.  Ant algorithms and stigmergy , 2000, Future Gener. Comput. Syst..

[34]  Richard Bellman,et al.  Mathematical Aspects Of Scheduling And Applications , 1982 .

[35]  Andrew B. Kahng,et al.  A new adaptive multi-start technique for combinatorial global optimizations , 1994, Oper. Res. Lett..

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

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

[38]  Léon J. M. Rothkrantz,et al.  Ant-Based Load Balancing in Telecommunications Networks , 1996, Adapt. Behav..

[39]  Erick Cantú-Paz,et al.  Efficient and Accurate Parallel Genetic Algorithms , 2000, Genetic Algorithms and Evolutionary Computation.

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

[41]  Michael Jünger,et al.  Provably good solutions for the traveling salesman problem , 1994, Math. Methods Oper. Res..

[42]  Luca Maria Gambardella,et al.  HAS-SOP: Hybrid Ant System for the Sequential Ordering Problem , 1997 .

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

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

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

[46]  Thomas Stützle,et al.  Local search algorithms for combinatorial problems - analysis, improvements, and new applications , 1999, DISKI.

[47]  Marco Dorigo,et al.  Ant system for Job-shop Scheduling , 1994 .

[48]  Gabriele Kotsis,et al.  Parallelization strategies for the ant system , 1998 .

[49]  Alice E. Smith,et al.  An ant system approach to redundancy allocation , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[50]  M. Dorigo,et al.  Ant System: An Autocatalytic Optimizing Process , 1991 .

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

[52]  Antonella Carbonaro,et al.  An ANTS heuristic for the frequency assignment problem , 2000, Future Gener. Comput. Syst..

[53]  Guy Theraulaz,et al.  Routing in Telecommunications Networks with Ant-Like Agents , 1999, IATA.

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

[55]  Andrew McCallum,et al.  Dynamic conditional random fields: factorized probabilistic models for labeling and segmenting sequence data , 2004, J. Mach. Learn. Res..

[56]  Fred Glover,et al.  Tabu Search - Part II , 1989, INFORMS J. Comput..

[57]  Gianni A. Di Caro,et al.  AntNet: A Mobile Agents Approach to Adaptive Routing , 1999 .

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

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

[60]  Z. Michalewicz,et al.  A new version of ant system for subset problems , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[61]  Marco Dorigo,et al.  Mobile agents for adaptive routing , 1998, Proceedings of the Thirty-First Hawaii International Conference on System Sciences.

[62]  Dimitri P. Bertsekas,et al.  Network optimization : continuous and discrete models , 1998 .

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

[64]  Ronald J. Williams,et al.  Simple Statistical Gradient-Following Algorithms for Connectionist Reinforcement Learning , 2004, Machine Learning.

[65]  J. Deneubourg,et al.  Modulation of trail laying in the antLasius niger (Hymenoptera: Formicidae) and its role in the collective selection of a food source , 1993, Journal of Insect Behavior.

[66]  Yuri Kochetov,et al.  Behavior of the Ant Colony Algorithm for the Set Covering Problem , 2000 .

[67]  Marco Dorigo,et al.  The ant colony optimization meta-heuristic , 1999 .

[68]  Joachim Stender,et al.  Parallel Genetic Algorithms: Introduction and Overview of Current Research , 1993 .

[69]  Marco Dorigo,et al.  Ant Colonies for Adaptive Routing in Packet-Switched Communications Networks , 1998, PPSN.

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

[71]  R. Mollica,et al.  Waging a new kind of war. Invisible wounds. , 2000, Scientific American.

[72]  T. Stützle,et al.  MAX-MIN Ant System and local search for the traveling salesman problem , 1997, Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97).

[73]  Martin Heusse,et al.  Adaptive Agent-Driven Routing and Load Balancing in Communication Networks , 1998, Adv. Complex Syst..

[74]  J. K. Lenstra,et al.  Local Search in Combinatorial Optimisation. , 1997 .

[75]  Christine Solnon,et al.  Solving Permutation Constraint Satisfaction Problems with Artificial Ants , 2000, ECAI.

[76]  Hartmut Schmeck,et al.  Information Exchange in Multi Colony Ant Algorithms , 2000, IPDPS Workshops.

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

[78]  Ram V. Rachamadugu,et al.  Accurate myopic heuristics for tardiness scheduling , 1984 .

[79]  W. Gutjahr.  A GENERALIZED CONVERGENCE RESULT FOR THE GRAPH-BASED ANT SYSTEM METAHEURISTIC , 2003, Probability in the Engineering and Informational Sciences.

[80]  M. C. Sinclair,et al.  Ant colony optimisation for virtual-wavelength-path routing and wavelength allocation , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

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

[82]  Richard F. Hartl,et al.  An ant colony optimization approach for the single machine total tardiness problem , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

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

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

[85]  Richard S. Sutton,et al.  Reinforcement Learning: An Introduction , 1998, IEEE Trans. Neural Networks.

[86]  Andrew G. Barto,et al.  Reinforcement learning , 1998 .

[87]  Hartmut Schmeck,et al.  Multi Colony Ant Algorithms , 2002, J. Heuristics.

[88]  H. R. Lourenço,et al.  Adaptive Approach Heuristics for The Generalized Assignment Problem , 1998 .

[89]  M Dorigo,et al.  Ant colonies for the travelling salesman problem. , 1997, Bio Systems.

[90]  Richard F. Hartl,et al.  Applying the ANT System to the Vehicle Routing Problem , 1999 .

[91]  Richard F. Hartl,et al.  An improved Ant System algorithm for theVehicle Routing Problem , 1999, Ann. Oper. Res..

[92]  E. D. Taillard,et al.  Ant Systems , 1999 .

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

[94]  Luca Maria Gambardella,et al.  Ant-Q: A Reinforcement Learning Approach to the Traveling Salesman Problem , 1995, ICML.

[95]  Silvano Martello,et al.  Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization , 2012 .