Ant Colony Optimization

Ant Colony Optimization (ACO) is a paradigm for designing metaheuristic algorithms for combinatorial optimization problems. The first algorithm which can be classified within this framework was presented in 1991 [21, 13] and, since then, many diverse variants of the basic principle have been reported in the literature. The essential trait of ACO algorithms is the combination of a priori information about the structure of a promising solution with a posteriori information about the structure of previously obtained good solutions.

[1]  Eric Bonabeau,et al.  Evolving Ant Colony Optimization , 1998, Adv. Complex Syst..

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

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

[4]  Michael Schreyer.  Letting Ants Labeling Point Features , 2002 .

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

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

[7]  Roberto Baldacci,et al.  A Bionomic Approach to the Capacitated p-Median Problem , 1998, J. Heuristics.

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

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

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

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

[12]  Ying Wang,et al.  Ant colony optimization for multicast routing , 2000, IEEE APCCAS 2000. 2000 IEEE Asia-Pacific Conference on Circuits and Systems. Electronic Communication Systems. (Cat. No.00EX394).

[13]  Brian W. Kernighan,et al.  An Effective Heuristic Algorithm for the Traveling-Salesman Problem , 1973, Oper. Res..

[14]  Günther R. Raidl,et al.  Letting ants labeling point features [sic.: for 'labeling' read 'label'] , 2002, Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600).

[15]  Niklas Kohl,et al.  K-Path Cuts for the Vehicle Routing Problem with Time Windows. , 1996 .

[16]  Bjarne E. Helvik,et al.  Cross entropy guided ant-like agents finding dependable primary/backup path patterns in networks , 2002, Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600).

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

[18]  Bruce E. Hajek,et al.  Cooling Schedules for Optimal Annealing , 1988, Math. Oper. Res..

[19]  Thomas Bäck,et al.  An Overview of Evolutionary Algorithms for Parameter Optimization , 1993, Evolutionary Computation.

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

[21]  Michael Sampels,et al.  Ant colony optimization for FOP shop scheduling: a case study on different pheromone representations , 2002, Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600).

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

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

[24]  Elon Rimon,et al.  Spanning-tree based coverage of continuous areas by a mobile robot , 2001, Proceedings 2001 ICRA. IEEE International Conference on Robotics and Automation (Cat. No.01CH37164).

[25]  Antonio Alfredo Ferreira Loureiro,et al.  A GPS/ant-like routing algorithm for ad hoc networks , 2000, 2000 IEEE Wireless Communications and Networking Conference. Conference Record (Cat. No.00TH8540).

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

[27]  L. Escudero.  An inexact algorithm for the sequential ordering problem , 1988 .

[28]  Jacques Desrosiers,et al.  2-Path Cuts for the Vehicle Routing Problem with Time Windows , 1997, Transp. Sci..

[29]  S. Kulturel-Konak,et al.  Meta heuristics for the orienteering problem , 2002, Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600).

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

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

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

[33]  Stephen Chen,et al.  Commonality and Genetic Algorithms , 1996 .

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

[35]  Peter Dayan,et al.  Technical Note: Q-Learning , 2004, Machine Learning.

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

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

[38]  Martin W. P. Savelsbergh,et al.  10. Vehicle routing: handling edge exchanges , 2003 .

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

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

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

[42]  Wu Bin,et al.  CSIM: a document clustering algorithm based on swarm intelligence , 2002, Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600).

[43]  Thomas Stützle,et al.  The Ant Colony Optimization Metaheuristic: Algorithms, Applications, and Advances , 2003 .

[44]  M. Savelsbergh.  An efficient implementation of local search algorithms for constrained routing problems , 1990 .

[45]  Thomas Stützle,et al.  A Comparison of Nature Inspired Heuristics on the Traveling Salesman Problem , 2000, PPSN.

[46]  Antonella Carbonaro,et al.  Ant Colony Optimization: An Overview , 2002 .

[47]  Paul Shaw,et al.  Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems , 1998, CP.

[48]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[49]  Peter van Beek,et al.  Constraint-Based Vehicle Assembly Line Sequencing , 2001, Canadian Conference on AI.

[50]  Yves Rochat,et al.  Probabilistic diversification and intensification in local search for vehicle routing , 1995, J. Heuristics.

[51]  Norbert Ascheuer,et al.  Hamiltonian path problems in the on-line optimization of flexible manufacturing systems , 1996 .

[52]  É. Taillard.  COMPARISON OF ITERATIVE SEARCHES FOR THE QUADRATIC ASSIGNMENT PROBLEM. , 1995 .

[53]  Thomas Stützle,et al.  Improvements on the Ant-System: Introducing the MAX-MIN Ant System , 1997, ICANNGA.

[54]  Qijun Gu,et al.  A heuristic ant algorithm for solving QoS multicast routing problem , 2002, Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600).

[55]  Taichi Kaji.  Approach by ant tabu agents for Traveling Salesman Problem , 2001, 2001 IEEE International Conference on Systems, Man and Cybernetics. e-Systems and e-Man for Cybernetics in Cyberspace (Cat.No.01CH37236).

[56]  P. V. Beek,et al.  Constraint-based Assembly Line Sequencing Date , 2001 .

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

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

[59]  Thomas Stützle,et al.  The MAX–MIN Ant System and Local Search for Combinatorial Optimization Problems: Towards Adaptive Tools for Global Optimization , 1997 .

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

[61]  Elon Rimon,et al.  Spanning-tree based coverage of continuous areas by a mobile robot , 2004, Annals of Mathematics and Artificial Intelligence.

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

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

[64]  T. Krink,et al.  Phone routing using the dynamic memory model , 2002, Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600).

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

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

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

[68]  Samy Bengio,et al.  The Vehicle Routing Problem with Time Windows Part II: Genetic Search , 1996, INFORMS J. Comput..

[69]  Thomas G. Dietterich.  What is machine learning? , 2020, Archives of Disease in Childhood.

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

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

[72]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[73]  Cheng-Fa Tsai,et al.  A new approach for solving large traveling salesman problem , 2002, Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600).

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

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

[76]  S. J. Huang,et al.  Enhancement of Hydroelectric Generation Scheduling Using Ant Colony System-Based Optimization Approaches , 2001, IEEE Power Engineering Review.

[77]  Jon Jouis Bentley,et al.  Fast Algorithms for Geometric Traveling Salesman Problems , 1992, INFORMS J. Comput..

[78]  Caj Cor Hurkens,et al.  Upper and lower bounding techniques for frequency assignment problems , 1995 .