A History of Metaheuristics

In this talk, we give a birds-eye overview of the most important developments in the field of metaheuristics. Our history is not a chronological list of ``important contributions'', but rather divides time into five distinct periods, defined by important shifts in the metaheuristic paradigm.

[1]  Thomas Stützle,et al.  An Iterated Greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives , 2008, Eur. J. Oper. Res..

[2]  Ingo Rechenberg,et al.  Evolution Strategy: Nature’s Way of Optimization , 1989 .

[3]  G. Dueck.  New optimization heuristics , 1993 .

[4]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .

[5]  F. Glover.  HEURISTICS FOR INTEGER PROGRAMMING USING SURROGATE CONSTRAINTS , 1977 .

[6]  Lawrence J. Fogel,et al.  Artificial Intelligence through Simulated Evolution , 1966 .

[7]  L. Darrell Whitley,et al.  Problem difficulty for tabu search in job-shop scheduling , 2003, Artif. Intell..

[8]  David Pisinger,et al.  An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows , 2006, Transp. Sci..

[9]  WeylandDennis.  A Rigorous Analysis of the Harmony Search Algorithm , 2010 .

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

[11]  Gerhard W. Dueck,et al.  Threshold accepting: a general purpose optimization algorithm appearing superior to simulated anneal , 1990 .

[12]  John Baxter,et al.  Local Optima Avoidance in Depot Location , 1981 .

[13]  Allen Newell,et al.  Heuristic Problem Solving: The Next Advance in Operations Research , 1958 .

[14]  Fred W. Glover,et al.  A Template for Scatter Search and Path Relinking , 1997, Artificial Evolution.

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

[16]  Kenneth Sörensen,et al.  Metaheuristics - the metaphor exposed , 2015, Int. Trans. Oper. Res..

[17]  Abraham P. Punnen,et al.  A survey of very large-scale neighborhood search techniques , 2002, Discret. Appl. Math..

[18]  L. Darrell Whitley,et al.  Contrasting Structured and Random Permutation Flow-Shop Scheduling Problems: Search-Space Topology and Algorithm Performance , 2002, INFORMS J. Comput..

[19]  Francisco J. Rodríguez,et al.  Tabu search with strategic oscillation for the quadratic minimum spanning tree , 2014 .

[20]  Harvey H. Shore.  THE TRANSPORTATION PROBLEM AND THE VOGEL APPROXIMATION METHOD , 1970 .

[21]  J J Hopfield,et al.  Neural networks and physical systems with emergent collective computational abilities. , 1982, Proceedings of the National Academy of Sciences of the United States of America.

[22]  Mirko Krivánek,et al.  Simulated Annealing: A Proof of Convergence , 1994, IEEE Trans. Pattern Anal. Mach. Intell..

[23]  Fred W. Glover,et al.  Adaptive memory search for Boolean optimization problems , 2004, Discret. Appl. Math..

[24]  F. Glover,et al.  Fundamentals of Scatter Search and Path Relinking , 2000 .

[25]  Celso C. Ribeiro,et al.  Effective Probabilistic Stopping Rules for Randomized Metaheuristics: GRASP Implementations , 2011, LION.

[26]  Herbert A. Simon,et al.  The Sciences of the Artificial , 1970 .

[27]  Pablo Moscato,et al.  On Evolution, Search, Optimization, Genetic Algorithms and Martial Arts : Towards Memetic Algorithms , 1989 .

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

[29]  Pierre Hansen,et al.  Variable Neighborhood Search , 2018, Handbook of Heuristics.

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

[31]  Fred W. Glover,et al.  Strategic oscillation for the capacitated hub location problem with modular links , 2016, J. Heuristics.

[32]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[33]  Dennis Weyland,et al.  A Rigorous Analysis of the Harmony Search Algorithm: How the Research Community can be Misled by a "Novel" Methodology , 2010, Int. J. Appl. Metaheuristic Comput..

[34]  Helena Ramalhinho Dias Lourenço,et al.  Iterated Local Search , 2001, Handbook of Metaheuristics.

[35]  J. Carbonell.  Learning by Analogy: Formulating and Generalizing Plans from Past Experience , 1983 .

[36]  Francisco J. Rodríguez,et al.  Tabu-enhanced iterated greedy algorithm: A case study in the quadratic multiple knapsack problem , 2014, Eur. J. Oper. Res..

[37]  Celso C. Ribeiro,et al.  Greedy Randomized Adaptive Search Procedures , 2003, Handbook of Metaheuristics.

[38]  Nenad Mladenovic,et al.  Variable neighborhood search for location routing , 2013, Comput. Oper. Res..

[39]  Fred W. Glover,et al.  A very large-scale neighborhood search algorithm for the multi-resource generalized assignment problem , 2004, Discret. Optim..