Skip to main content
SpringerLink
Log in

Metaheuristics

  • Reference work entry
Encyclopedia of Optimization

Article Outline

Keywords and Phrases

Introduction

Definitions

  Local Search

  Metaheuristics

Metaheuristic Methods

  Simple Local Search Based Metaheuristics

  Simulated Annealing

  Tabu Search

  Evolutionary Algorithms

  Swarm Intelligence

  Miscellaneous

General Frames

  Adaptive Memory Programming

  A Pool Template

  Partial Optimization Metaheuristic Under Special Intensification Conditions

  Hybrids with Exact Methods

  Optimization Software Libraries

Applications

Conclusions

References

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 2,500.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 2,499.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. Aarts EHL, Lenstra JK (eds) (1997) Local Search in Combinatorial Optimization. Wiley, Chichester

    MATH  Google Scholar 

  2. Aarts EHL, Verhoeven M (1997) Local search. In: Dell'Amico M, Maffioli F, Martello S (eds) Annotated Bibliographies in Combinatorial Optimization. Wiley, Chichester, pp 163–180

    Google Scholar 

  3. Achterberg T, Berthold T (2007) Improving the feasibility pump. Discret Optim 4:77–86

    Article  MathSciNet  MATH  Google Scholar 

  4. Adenso-Diaz B, Laguna M (2006) Fine-tuning of algorithms using fractional experimental designs and local search. Oper Res 54:99–114

    Article  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  6. Alba E (ed) (2005) Parallel Metaheuristics. Wiley, Hoboken

    MATH  Google Scholar 

  7. Alba E, Marti R (eds) (2006) Metaheuristic Procedures for Training Neural Networks. Springer, New York

    MATH  Google Scholar 

  8. Althöfer I, Koschnick KU (1991) On the convergence of ‘threshold accepting’. Appl Math Optim 24:183–195

    Article  MathSciNet  MATH  Google Scholar 

  9. Bäck T, Fogel DB, Michalewicz Z (eds) (1997) Handbook of Evolutionary Computation. Institute of Physics Publishing, Bristol

    MATH  Google Scholar 

  10. Barr RS, Golden BL, Kelly JP, Resende MGC, Stewart WR (1995) Designing and reporting on computational experiments with heuristic methods. J Heuristics 1:9–32

    Article  MATH  Google Scholar 

  11. Bastos MB, Ribeiro CC (2002) Reactive tabu search with path relinking for the Steiner problem in graphs. In: Ribeiro CC, Hansen P (eds) Essays and Surveys in Metaheuristics. Kluwer, Boston, pp 39–58

    Google Scholar 

  12. Battiti R, Tecchiolli G (1994) The reactive tabu search. ORSA J Comput 6:126–140

    MATH  Google Scholar 

  13. Bertsekas DP, Tsitsiklis JN, Wu C (1997) Rollout algorithms for combinatorial optimization. J Heuristics 3:245–262

    Article  MATH  Google Scholar 

  14. Blum C, Roli A (2003) Metaheuristics in combinatorial optimization: Overview conceptual comparison. ACM Comput Surv 35:268–308

    Article  Google Scholar 

  15. Bonabeau E, Dorigo M, Theraulaz G (eds) (1999) Swarm Intelligence – From Natural to Artificial Systems. Oxford University Press, New York

    MATH  Google Scholar 

  16. Burke EK, Kendall G, Newall J, Hart E, Ross P, Schulenburg S (2003) Hyper-heuristics: An emerging direction in modern search technology. In: Glover FW, Kochenberger GA (eds) Handbook of Metaheuristics. Kluwer, Boston, pp 457–474

    Chapter  Google Scholar 

  17. Caseau Y, Laburthe F, Silverstein G (1999) A meta-heuristic factory for vehicle routing problems. Lect Notes Comput Sci 1713:144–158

    Google Scholar 

  18. Cerulli R, Fink A, Gentili M, Voß S (2006) Extensions of the minimum labelling spanning tree problem. J Telecommun Inf Technol 4/2006:39–45

    Google Scholar 

  19. Charon I, Hudry O (1993) The noising method: A new method for combinatorial optimization. Oper Res Lett 14:133–137

    Article  MathSciNet  MATH  Google Scholar 

  20. Crainic TG, Toulouse M, Gendreau M (1997) Toward a taxonomy of parallel tabu search heuristics. INFORMS J Comput 9:61–72

    Article  MATH  Google Scholar 

  21. de Backer B, Furnon V, Shaw P, Kilby P, Prosser P (2000) Solving vehicle routing problems using constraint programming and metaheuristics. J Heuristics 6:501–523

    Article  MATH  Google Scholar 

  22. Di Gaspero L, Schaerf A (2003) EASYLOCAL++: An object-oriented framework for the flexible design of local-search algorithms. Softw Pr Experience 33:733–765

    Article  Google Scholar 

  23. Dorigo M, Maniezzo V, Colorni A (1996) Ant system: Optimization by a colony of cooperating agents. IEEE Trans Syst, Man Cybern B 26:29–41

    Article  Google Scholar 

  24. Dorigo M, Stützle T (2004) Ant Colony Optimization. MIT Press, Cambridge

    MATH  Google Scholar 

  25. Dörner KF, Gendreau M, Greistorfer P, Gutjahr WJ, Hartl RF, Reimann M (eds) (2007) Metaheuristics: Progress in Complex Systems Optimization. Springer, New York

    MATH  Google Scholar 

  26. Dowsland KA (1993) Simulated annealing. In: Reeves C (ed) Modern Heuristic Techniques for Combinatorial Problems. Halsted, Blackwell, pp 20–69

    Google Scholar 

  27. Dreo J, Petrowski A, Siarry P, Taillard E (2006) Metaheuristics for Hard Optimization. Springer, Berlin

    MATH  Google Scholar 

  28. Dueck G, Scheuer T (1990) Threshold accepting: a general purpose optimization algorithm appearing superior to simulated annealing. J Comput Phys 90:161–175

    Article  MathSciNet  MATH  Google Scholar 

  29. Duin CW, Voß S (1994) Steiner tree heuristics – a survey. In: Dyckhoff H, Derigs U, Salomon M, Tijms HC (eds) Operations Research Proceedings. Springer, Berlin, pp 485–496

    Google Scholar 

  30. Duin CW, Voß S (1999) The pilot method: A strategy for heuristic repetition with application to the Steiner problem in graphs. Netw 34:181–191

    Article  MATH  Google Scholar 

  31. Faigle U, Kern W (1992) Some convergence results for probabilistic tabu search. ORSA J Comput 4:32–37

    MATH  Google Scholar 

  32. Festa P, Resende MGC (2004) An annotated bibliography of GRASP. Technical report, AT&T Labs Research, Florham Park

    Google Scholar 

  33. Fink A, Voß S (2002) HotFrame: A heuristic optimization framework. In: Voß S, Woodruff DL (eds) Optimization Software Class Libraries. Kluwer, Boston, pp 81–154

    Google Scholar 

  34. Fischetti M, Glover F, Lodi A (2005) The feasibility pump. Math Program A 104:91–104

    Article  MathSciNet  MATH  Google Scholar 

  35. Fischetti M, Lodi A (2003) Local branching. Math Program B 98:23–47

    Article  MathSciNet  MATH  Google Scholar 

  36. Fogel DB (1993) On the philosophical differences between evolutionary algorithms and genetic algorithms. In: Fogel DB, Atmar W (eds) Proceedings of the Second Annual Conference on Evolutionary Programming, Evolutionary Programming Society, La Jolla, pp 23–29

    Google Scholar 

  37. Fogel DB (1995) Evolutionary Computation: Toward a New Philosophy of Machine Intelligence. IEEE Press, New York

    Google Scholar 

  38. Glover F (1977) Heuristics for integer programming using surrogate constraints. Decis Sci 8:156–166

    Article  Google Scholar 

  39. Glover F (1986) Future paths for integer programming links to artificial intelligence. Comput Oper Res 13:533–549

    Article  MathSciNet  MATH  Google Scholar 

  40. Glover F (1990) Tabu search – Part II. ORSA J Comput 2:4–32

    MATH  Google Scholar 

  41. Glover F (1995) Scatter search and star-paths: beyond the genetic metaphor. OR Spektrum 17:125–137

    Article  MATH  Google Scholar 

  42. Glover F (1997) Tabu search and adaptive memory programming – Advances, applications challenges. In: Barr RS, Helgason RV, Kennington JL (eds) Interfaces in computer science and operations research: Advances in metaheuristics, optimization and stochastic modeling technologies. Kluwer, Boston, pp 1–75

    Google Scholar 

  43. Glover F, Laguna M (1997) Tabu Search. Kluwer, Boston

    MATH  Google Scholar 

  44. Glover FW, Kochenberger GA (eds) (2003) Handbook of Metaheuristics. Kluwer, Boston

    MATH  Google Scholar 

  45. Goldberg DE (1989) Genetic Algorithms in Search, Optimization, Machine Learning. Addison-Wesley, Reading

    Google Scholar 

  46. Golden BL, Raghavan S, Wasil EA (eds) (2005) The Next Wave in Computing, Optimization, Decision Technologies. Kluwer, Boston

    Google Scholar 

  47. Gomes AM, Oliveira JF (2006) Solving irregular strip packing problems by hybridising simulated annealing and linear programming. Eur J Oper Res 171:811–829

    Article  MATH  Google Scholar 

  48. Greistorfer P, Voß S (2005) Controlled pool maintenance for meta-heuristics. In: Rego C, Alidaee B (eds) Metaheuristic optimization via memory evolution. Kluwer, Boston, pp 387–424

    Chapter  Google Scholar 

  49. Gutenschwager K, Niklaus C, Voß S (2004) Dispatching of an electric monorail system: Applying meta-heuristics to an online pickup and delivery problem. Transp Sci 38:434–446

    Article  Google Scholar 

  50. Hajek B (1988) Cooling schedules for optimal annealing. Math Oper Res 13:311–329

    Article  MathSciNet  MATH  Google Scholar 

  51. Hansen P, Mladenović N (1999) An introduction to variable neighborhood search. In: Voß S, Martello S, Osman IH, Roucairol C (eds) Meta-heuristics: Advances and trends in local search paradigms for optimization. Kluwer, Boston, pp 433–458

    Google Scholar 

  52. Hart JP, Shogan AW (1987) Semi-greedy heuristics: An empirical study. Oper Res Lett 6:107–114

    Article  MathSciNet  MATH  Google Scholar 

  53. Harvey W, Ginsberg M (1995) Limited discrepancy search. In: Proceedings of the 14th IJCAI. Morgan Kaufmann, San Mateo, pp 607–615

    Google Scholar 

  54. Hertz A, Kobler D (2000) A framework for the description of evolutionary algorithms. Eur J Oper Res 126:1–12

    Article  MathSciNet  MATH  Google Scholar 

  55. Hoffmeister F, Bäck T (1991) Genetic algorithms and evolution strategies: Similarities and differences. Lect Notes Comput Sci 496:455–469

    Article  Google Scholar 

  56. Holland JH (1975) Adaptation in Natural and Artificial Systems. The University of Michigan Press, Ann Arbor

    Google Scholar 

  57. Hooker JN (1995) Testing heuristics: We have it all wrong. J Heuristics 1:33–42

    Article  MATH  Google Scholar 

  58. Hoos HH, Stützle T (2005) Stochastic Local Search – Foundations and Applications. Elsevier, Amsterdam

    MATH  Google Scholar 

  59. Ibaraki T, Nonobe K, Yagiura M (eds) (2005) Metaheuristics: Progress as Real Problem Solvers. Springer, New York

    MATH  Google Scholar 

  60. Ingber L (1996) Adaptive simulated annealing (ASA): Lessons learned. Control Cybern 25:33–54

    MATH  Google Scholar 

  61. Jaszkiewicz A (2004) A comparative study of multiple-objective metaheuristics on the bi-objective set covering problem and the pareto memetic algorithm. Ann Oper Res 131:215–235

    Article  MathSciNet  Google Scholar 

  62. Johnson DS, Aragon CR, McGeoch LA, Schevon C (1989) Optimization by simulated annealing: An experimental evaluation; part i, graph partitioning. Oper Res 37:865–892

    Article  MATH  Google Scholar 

  63. Kennedy J, Eberhart RC (2001) Swarm Intelligence. Elsevier, Amsterdam

    Google Scholar 

  64. Kirkpatrick S, Gelatt CD Jr, Vecchi MP (1983) Optimization by simulated annealing. Science 220:671–680

    Article  MathSciNet  Google Scholar 

  65. Laguna M, Martí R (2003) Scatter Search. Kluwer, Boston

    MATH  Google Scholar 

  66. Lin S, Kernighan BW (1973) An effective heuristic algorithm for the traveling-salesman problem. Oper Res 21:498–516

    Article  MathSciNet  MATH  Google Scholar 

  67. McGeoch C (1996) Toward an experimental method for algorithm simulation. INFORMS J Comput 8:1–15

    Article  MATH  Google Scholar 

  68. Meloni C, Pacciarelli D, Pranzo M (2004) A rollout metaheuristic for job shop scheduling problems. Ann Oper Res 131:215–235

    Article  MathSciNet  MATH  Google Scholar 

  69. Michalewicz Z (1999) Genetic Algorithms + Data Structures = Evolution Programs, 3rd edn. Springer, Berlin

    Google Scholar 

  70. Michalewicz Z, Fogel DB (2004) How to Solve It: Modern Heuristics, 2nd edn. Springer, Berlin

    MATH  Google Scholar 

  71. Moscato P (1993) An introduction to population approaches for optimization and hierarchical objective functions: A discussion on the role of tabu search. Ann Oper Res 41:85–121

    Article  MATH  Google Scholar 

  72. Osman IH, Kelly JP (eds) (1996) Meta-Heuristics: Theory and Applications. Kluwer, Boston

    MATH  Google Scholar 

  73. Pearl J (1984) Heuristics: Intelligent Search Strategies for Computer Problem Solving. Addison-Wesley, Reading

    Google Scholar 

  74. Pesant G, Gendreau M (1999) A constraint programming framework for local search methods. J Heuristics 5:255–279

    Article  MATH  Google Scholar 

  75. Pesch E, Glover F (1997) TSP ejection chains. Discret Appl Math 76:165–182

    Article  MathSciNet  MATH  Google Scholar 

  76. Polya G (1945) How to solve it. Princeton University Press, Princeton

    MATH  Google Scholar 

  77. Rayward-Smith VJ, Osman IH, Reeves CR, Smith GD (eds) (1996) Modern Heuristic Search Methods. Wiley, Chichester

    MATH  Google Scholar 

  78. Reeves CR, Rowe JE (2002) Genetic Algorithms: Principles and Perspectives. Kluwer, Boston

    Google Scholar 

  79. Rego C, Alidaee B (eds) (2005) Metaheuristic optimization via memory and evolution. Kluwer, Boston

    MATH  Google Scholar 

  80. Resende MGC, de Sousa JP (eds) (2004) Metaheuristics: Computer Decision-Making. Kluwer, Boston

    Google Scholar 

  81. Ribeiro CC, Hansen P (eds) (2002) Essays and Surveys in Metaheuristics. Kluwer, Boston

    MATH  Google Scholar 

  82. Sakawa M (2001) Genetic algorithms and fuzzy multiobjective optimization. Kluwer, Boston

    Google Scholar 

  83. Schwefel HP, Bäck T (1998) Artificial evolution: How and why? In: Quagliarella D, Périaux J, Poloni C, Winter G (eds) Genetic Algorithms and Evolution Strategy in Engineering and Computer Science: Recent Advances and Industrial Applications, Wiley, Chichester, pp 1–19

    Google Scholar 

  84. Shaw P (1998) Using constraint programming local search methods to solve vehicle routing problems. Working paper, ILOG SA, Gentilly

    Google Scholar 

  85. Smith K (1999) Neural networks for combinatorial optimisation: A review of more than a decade of research. INFORMS J Comput 11:15–34

    Article  MathSciNet  MATH  Google Scholar 

  86. Sniedovich M, Voß S (2006) The corridor method: A dynamic programming inspired metaheuristic. Control Cybern 35:551–578

    MATH  Google Scholar 

  87. Storer RH, Wu SD, Vaccari R (1995) Problem and heuristic space search strategies for job shop scheduling. ORSA J Comput 7:453–467

    MATH  Google Scholar 

  88. Taillard E, Voß S (2002) POPMUSIC - partial optimization metaheuristic under special intensification conditions. In: Ribeiro CC, Hansen P (eds) Essays and Surveys in Metaheuristics. Kluwer, Boston, pp 613–629

    Google Scholar 

  89. Taillard ÉD, Gambardella LM, Gendreau M, Potvin JY (2001) Adaptive memory programming: A unified view of meta-heuristics. Eur J Oper Res 135:1–16

    Google Scholar 

  90. Vaessens RJM, Aarts EHL, Lenstra JK (1998) A local search template. Comput Oper Res 25:969–979

    Article  MathSciNet  MATH  Google Scholar 

  91. Verhoeven MGA, Aarts EHL (1995) Parallel local search techniques. J Heuristics 1:43–65

    Article  MATH  Google Scholar 

  92. Voß S (1993) Intelligent Search. Manuscript, TU Darmstadt

    Google Scholar 

  93. Voß S (1993) Tabu search: applications and prospects. In: Du DZ, Pardalos P (eds) Network Optimization Problems. World Scientific, Singapore, pp 333–353

    Google Scholar 

  94. Voß S (1996) Observing logical interdependencies in tabu search: Methods and results. In: Rayward-Smith VJ, Osman IH, Reeves CR, Smith GD (eds) Modern Heuristic Search Methods. Wiley, Chichester, pp 41–59

    Google Scholar 

  95. Voß S (2001) Meta-heuristics: The state of the art. Lect Notes Artif Intell 2148:1–23

    Google Scholar 

  96. Voß S, Fink A, Duin C (2004) Looking ahead with the pilot method. Ann Oper Res 136:285–302

    Article  Google Scholar 

  97. Voß S, Martello S, Osman IH, Roucairol C (eds) (1999) Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization. Kluwer, Boston

    MATH  Google Scholar 

  98. Voß S, Woodruff DL (eds) (2002) Optimization Software Class Libraries. Kluwer, Boston

    MATH  Google Scholar 

  99. Watson JP, Whitley LD, Howe AE (2005) Linking search space structure, run-time dynamics, and problem difficulty: A step toward demystifying tabu search. J Artif Intell Res 24:221–261

    Article  MATH  Google Scholar 

  100. Whitley D, Rana S, Dzubera J, Mathias KE (1996) Evaluating evolutionary algorithms. Artif Intell 85:245–276

    Article  Google Scholar 

  101. Wolpert DH, Macready WG (1997) No free lunch theorems for optimization. IEEE Trans Evol Comput 1:67–82

    Article  Google Scholar 

  102. Woodruff DL (1998) Proposals for chunking and tabu search. Eur J Oper Res 106:585–598

    Article  MATH  Google Scholar 

  103. Woodruff DL (1999) A chunking based selection strategy for integrating meta-heuristics with branch and bound. In: Voß S, Martello S, Osman IH, Roucairol C (eds) Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization. Kluwer, Boston, pp 499–511

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Information Systems (Wirtschaftsinformatik), University of Hamburg, Hamburg, Germany

    Stefan Voß

Authors
  1. Stefan Voß
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Chemical Engineering, Princeton University, Princeton, NJ, 08544-5263, USA

    Christodoulos A. Floudas

  2. Center for Applied Optimization, Department of Industrial and Systems Engineering, University of Florida, Gainesville, FL, 32611-6595, USA

    Panos M. Pardalos

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag

About this entry

Cite this entry

Voß, S. (2008). Metaheuristics . In: Floudas, C., Pardalos, P. (eds) Encyclopedia of Optimization. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-74759-0_367

Download citation

Publish with us

Policies and ethics

Search

Navigation