The ant colony optimization meta-heuristic

This chapter contains sections titled: Combinatorial Optimization, The ACO Metaheuristic, How Do I Apply ACO?, Other Metaheuristics, Bibliographical Remarks, Things to Remember, Thought and Computer Exercises

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

[2]  Corso Elvezia.  Ant Colonies for the QAP , 1997 .

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

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

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

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

[7]  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).

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

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

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

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

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

[13]  David S. Johnson,et al.  Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .

[14]  R. Burkard,et al.  The Travelling Salesman Problem on Permuted , 1999 .

[15]  Dimitri P. Bertsekas,et al.  Dynamic Programming and Optimal Control, Two Volume Set , 1995 .

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

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

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

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

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

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

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

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

[24]  Fred W. Glover,et al.  Tabu Search - Part I , 1989, INFORMS J. Comput..

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

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

[27]  Marco Dorigo,et al.  From Natural to Artificial Swarm Intelligence , 1999 .

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

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

[30]  W. Daniel Hillis,et al.  The connection machine , 1985 .

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

[32]  Shen Lin.  Computer solutions of the traveling salesman problem , 1965 .

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

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

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

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

[37]  Luca Maria Gambardella,et al.  A Multiple Ant Colony System for Vehicle Routing Problems with Time Windows , 1999 .

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

[39]  Marco Dorigo,et al.  Swarm intelligence: from natural to artificial systems , 1999 .

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

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

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

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

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

[45]  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).

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

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

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

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

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

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

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