Skip to main content
SpringerLink
Log in

A History of Metaheuristics

  • Reference work entry
  • First Online:
Handbook of Heuristics

Abstract

This chapter describes the history of metaheuristics in five distinct periods, starting long before the first use of the term and ending a long time in the future.

The field of metaheuristics has undergone several paradigm shifts that have changed the way researchers look upon the development of heuristic methods. Most notably, there has been a shift from the method-centric period, in which metaheuristics were thought of as algorithms, to the framework-centric period, in which researchers think of metaheuristics as more general high-level frameworks, i.e., consistent collections of concepts and ideas that offer guidelines on how to go about solving an optimization problem heuristically.

Tremendous progress has been made in the development of heuristics over the years. Optimization problems that seemed intractable only a few decades ago can now be efficiently solved. Nevertheless, there is still much room for evolution in the research field, an evolution that will allow it to move into the scientific period. In this period, we will see more structured knowledge generation that will benefit both researchers and practitioners.

Unfortunately, a significant fraction of the research community has deluded itself into thinking that scientific progress can be made by resorting to ever more outlandish metaphors as the basis for so-called “novel” methods. Even though considerable damage to the research field will have been inflicted by the time these ideas have been stamped out, there is no doubt that science will ultimately prevail.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 999.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 1,199.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Ahuja RK, Ergun Ö, Orlin JB, Punnen AP (2002) A survey of very large-scale neighborhood search techniques. Discret Appl Math 123 (1): 75–102

    Google Scholar 

  2. Baxter J (1981) Local optima avoidance in depot location. J Oper Res Soc 32:815–819

    Google Scholar 

  3. Carbonell JG (1983) Learning by analogy: formulating and generalizing plans from past experience. In: Machine learning. Springer Science & Business Media, Berlin/Heidelberg, pp 137–161. https://doi.org/10.1007/978-3-662-12405-5_5

  4. Chu T (2014) Human purpose and transhuman potential: a cosmic vision for our future evolution. Origin Press, San Rafael. ISBN:978-1-57983-0250

    Google Scholar 

  5. Colorni A, Dorigo M, Maniezzo V (1992) Distributed optimization by ant colonies. In: Varela FJ, Bourgine P (eds) Proceedings of the first European conference on artificial life. MIT Press, Cambridge, pp 134–142

    Google Scholar 

  6. Corberán Á, Peiró J, Campos V, Glover F, Martí R (2016) Strategic oscillation for the capacitated hub location problem with modular links. J Heuristics 22 (2): 221–244

    Google Scholar 

  7. Cormen TH, Leiserson CE, Rivest RL, Stein C (2009) Introduction to algorithms, 3rd edn. MIT Press, Cambridge. ISBN:978-0-262-03384-8

    Google Scholar 

  8. Dueck G (1993) New optimization heuristics. J Comput Phys 104 (1): 86–92. https://doi.org/10.1006/jcph.1993.1010

  9. Dueck G, Scheuer T (1990) Threshold accepting: a general purpose optimization algorithm appearing superior to simulated annealing. J Comput Phys 90 (1): 161–175. https://doi.org/10.1016/0021-9991(90)90201-b

  10. Feo TA, Resende MGC (1995) Greedy randomized adaptive search procedures. J Glob Optim 6 (2): 109–133. https://doi.org/10.1007/bf01096763

  11. Fogel LJ, Owens AJ, Walsh MJ (1966) Artificial intelligence through simulated evolution. Wiley, New York

    Google Scholar 

  12. García-Martínez C, Rodriguez FJ, Lozano M (2014) Tabu-enhanced iterated greedy algorithm: a case study in the quadratic multiple knapsack problem. Eur J Oper Res 232 (3): 454–463

    Google Scholar 

  13. Glover F (1977) Heuristics for integer programming using surrogate constraints. Decis Sci 8 (1): 156–166. https://doi.org/10.1111/j.1540-5915.1977.tb01074.x

  14. Glover F (1986) Future paths for integer programming and links to artificial intelligence. Comput Oper Res 13 (5): 533–549. https://doi.org/10.1016/0305-0548(86)90048-1

  15. Glover F (1998) A template for scatter search and path relinking. In: Artificial evolution. Lecture notes in computer Science. Springer Science & Business Media, pp 1–51. https://doi.org/10.1007/bfb0026589

  16. Glover F, Laguna M (1997) Tabu search. Kluwer Academic Publishers/Springer, Boston

    Google Scholar 

  17. Glover F, Laguna M, Martí R (2000) Fundamentals of scatter search and path relinking. Control and Cybern 29 (3): 653–684

    Google Scholar 

  18. Goldberg D (1989) Genetic algorithms in search, optimization and machine learning. Addison-Wesley, Reading

    Google Scholar 

  19. Granville V, Krivanek M, Rasson J-P (1994) Simulated annealing: a proof of convergence. IEEE Trans Pattern Anal Mach Intell 16 (6): 652–656. https://doi.org/10.1109/34.295910

  20. Holland J (1975) Adaptation in natural and artificial systems. University of Michigan Press, Ann Arbor

    Google Scholar 

  21. Hopfield J (1982) Neural networks and physical systems with emergent collective computational capabilities. Proc Natl Acad Sci 79 (8): 2254–2558

    Google Scholar 

  22. Hvattum LM, Løkketangen A, Glover F (2004) Adaptive memory search for boolean optimization problems. Discret Appl Math 142 (1): 99–109

    Google Scholar 

  23. Jarboui B, Derbel H, Hanafi S, Mladenović N (2013) Variable neighborhood search for location routing. Comput Oper Res 40 (1): 47–57. https://doi.org/10.1016/j.cor.2012.05.009

  24. Kirkpatrick S, Gelatt CD, Vecchi MP (1983) Optimization by simulated annealing. Science 220 (4598): 671–680. https://doi.org/10.1126/science.220.4598.671

  25. Lourenço HR, Martin OC, Stützle T (2003) Iterated local search. Int Ser Oper Res Manag Sci 57:321–354

    Google Scholar 

  26. Lozano M, Glover F, García-Martínez C, Rodríguez FJ, Martí R (2014) Tabu search with strategic oscillation for the quadratic minimum spanning tree. IIE Trans 46 (4): 414–428

    Google Scholar 

  27. Maniezzo V, Stützle T, Voß S (eds) (2010) Matheuristics. Springer. https://doi.org/10.1007/978-1-4419-1306-7

  28. Mladenović N, Hansen P (1997) Variable neighborhood search. Comput Oper Res 24 (11): 1097–1100. https://doi.org/10.1016/s0305-0548(97)00031-2

  29. Moscato P (1989) On evolution, search, optimization, genetic algorithms and martial arts – towards memetic algorithms. Technical Report 826, Caltech Concurrent Computation Program, Pasadena

    Google Scholar 

  30. Polya G (2014) How to solve it: a new aspect of mathematical method. Princeton university press, Princeton

    Google Scholar 

  31. Rechenberg I (1989) Evolution strategy: nature’s way of optimization. In: Optimization: methods and applications, possibilities and limitations. Springer Science & Business Media, Berlin/New York, pp 106–126. https://doi.org/10.1007/978-3-642-83814-9_6

  32. Ribeiro CC, Rosseti I, Souza RC (2011) Effective probabilistic stopping rules for randomized metaheuristics: GRASP implementations. In: Learning and intelligent optimization. Lecture notes in computer science, vol 6683. Springer Science & Business Media, pp 146–160. https://doi.org/10.1007/978-3-642-25566-3_11

  33. Ropke S, Pisinger D (2006) An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transp Sci 40 (4): 455–472

    Article  Google Scholar 

  34. Ruiz R, Stützle T (2008) An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives. Eur J Oper Res 187 (3): 1143–1159

    Article  Google Scholar 

  35. Shore HH (1970) The transportation problem and the VOGEL approximation method. Decis Sci 1 (3-4): 441–457. https://doi.org/10.1111/j.1540-5915.1970.tb00792.x

  36. Simon HA (1996) The sciences of the artificial, 3rd edn. MIT Press, Cambridge

    Google Scholar 

  37. Simon HA, Newell A (1958) Heuristic problem solving: the next advance in operations research. Oper Res 6 (1): 1–10. https://doi.org/10.1287/opre.6.1.1

  38. Sörensen K (2015) Metaheuristics–the metaphor exposed. Int Trans Oper Res 22 (1): 3–18. https://doi.org/10.1111/itor.12001

  39. Sörensen K, Glover FW (2013) Metaheuristics. In: Gass SI, Fu MC (eds) Encyclopedia of operations research and management science, 663 3rd edn, pp 960–970, Springer, Boston, MA

    Chapter  Google Scholar 

  40. Watson J-P, Barbulescu L, Whitley LD, Howe AE (2002) Contrasting structured and random permutation flow-shop scheduling problems: search-space topology and algorithm performance. INFORMS J Comput 14 (2): 98–123. https://doi.org/10.1287/ijoc.14.2.98.120

  41. Watson J-P, Beck JC, Howe AE, Whitley LD (2003) Problem difficulty for tabu search in job-shop scheduling. Artif Intell 143 (2): 189–217. https://doi.org/10.1016/s0004-3702(02)00363-6

  42. Weyland D (2010) A rigorous analysis of the harmony search algorithm. Int J Appl Metaheuristic Comput 1 (2): 50–60. https://doi.org/10.4018/jamc.2010040104

  43. Yagiura M, Iwasaki S, Ibaraki T, Glover F (2004) A very large-scale neighborhood search algorithm for the multi-resource generalized assignment problem. Discret Optim 1 (1): 87–98

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Antwerp, Antwerp, Belgium

    Kenneth Sörensen

  2. Université de Bretagne-Sud, Lab-STICC, CNRS, Lorient, France

    Marc Sevaux

  3. OptTek Systems, Inc, Boulder, CO, USA

    Fred Glover

Authors
  1. Kenneth Sörensen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Marc Sevaux
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Fred Glover
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Kenneth Sörensen .

Editor information

Editors and Affiliations

  1. Statistics and Operations Research Department, University of Valencia, Valencia, Spain

    Rafael Martí

  2. Department of Industrial and Systems Engineering, University of Florida, Gainesville, Florida, USA

    Panos M. Pardalos

  3. Amazon.com, Inc. and University of Washington, Seattle, Washington, USA

    Mauricio G. C. Resende

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG, part of Springer Nature

About this entry

Check for updates. Verify currency and authenticity via CrossMark

Cite this entry

Sörensen, K., Sevaux, M., Glover, F. (2018). A History of Metaheuristics. In: Martí, R., Pardalos, P., Resende, M. (eds) Handbook of Heuristics. Springer, Cham. https://doi.org/10.1007/978-3-319-07124-4_4

Download citation

Publish with us

Policies and ethics

Search

Navigation