MAX-MIN Ant System

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

[2]  Future Generation Computer Systems , 2000 .

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

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

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

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

[7]  G. Di Caro,et al.  Ant colony optimization: a new meta-heuristic , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

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

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

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

[11]  A. Mobius,et al.  COMBINATORIAL OPTIMIZATION BY ITERATIVE PARTIAL TRANSCRIPTION , 1999, cond-mat/9902034.

[12]  Bernd Freisleben,et al.  Fitness landscapes and memetic algorithm design , 1999 .

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

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

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

[16]  É. Taillard,et al.  MACS-VRPTW: a multiple ant colony system for vehicle routing problems with time windows , 1999 .

[17]  Tim Walters,et al.  Repair and Brood Selection in the Traveling Salesman Problem , 1998, PPSN.

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

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

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

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

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

[23]  B. Freisleben,et al.  Genetic local search for the TSP: new results , 1997, Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97).

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

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

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

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

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

[29]  Shigenobu Kobayashi,et al.  Edge Assembly Crossover: A High-Power Genetic Algorithm for the Travelling Salesman Problem , 1997, ICGA.

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

[31]  Kenneth Dean Boese,et al.  Models for iterative global optimization , 1996 .

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

[33]  Luca Maria Gambardella,et al.  Results of the first international contest on evolutionary optimisation (1st ICEO) , 1996, Proceedings of IEEE International Conference on Evolutionary Computation.

[34]  Bernd Freisleben,et al.  A genetic local search algorithm for solving symmetric and asymmetric traveling salesman problems , 1996, Proceedings of IEEE International Conference on Evolutionary Computation.

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

[36]  Olivier C. Martin,et al.  Combining simulated annealing with local search heuristics , 1993, Ann. Oper. Res..

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

[38]  Terry Jones,et al.  Fitness Distance Correlation as a Measure of Problem Difficulty for Genetic Algorithms , 1995, ICGA.

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

[40]  Peter F. Stadler,et al.  Towards a theory of landscapes , 1995 .

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

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

[43]  Charles Fleurent,et al.  Genetic Hybrids for the Quadratic Assignment Problem , 1993, Quadratic Assignment and Related Problems.

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

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

[46]  Éric D. Taillard,et al.  Robust taboo search for the quadratic assignment problem , 1991, Parallel Comput..

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

[48]  Edward W. Felten,et al.  Large-Step Markov Chains for the Traveling Salesman Problem , 1991, Complex Syst..

[49]  Schloss Birlinghoven.  Evolution in Time and Space -the Parallel Genetic Algorithm , 1991 .

[50]  Emile H. L. Aarts,et al.  Genetic Local Search Algorithms for the Travelling Salesman Problem , 1990, PPSN.

[51]  S. Kirkpatrick,et al.  Configuration space analysis of travelling salesman problems , 1985 .

[52]  Eugene L. Lawler,et al.  Traveling Salesman Problem , 2016 .

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

[54]  Teofilo F. Gonzalez,et al.  P-Complete Approximation Problems , 1976, J. ACM.

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

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