Annals of Operations Research

, Volume 63, Issue 5, pp 511–623

Metaheuristics: A bibliography

  • Ibrahim H. Osman
  • Gilbert Laporte
Bibliography

DOI: 10.1007/BF02125421

Cite this article as:
Osman, I.H. & Laporte, G. Ann Oper Res (1996) 63: 511. doi:10.1007/BF02125421

Abstract

Metaheuristics are the most exciting development in approximate optimization techniques of the last two decades. They have had widespread successes in attacking a variety of difficult combinatorial optimization problems that arise in many practical areas. This bibliography provides a classification of a comprehensive list of 1380 references on the theory and application of metaheuristics. Metaheuristics include but are not limited to constraint logic programming; greedy random adaptive search procedures; natural evolutionary computation; neural networks; non-monotonic search strategies; space-search methods; simulated annealing; tabu search; threshold algorithms and their hybrids. References are presented in alphabetical order under a number of subheadings.

Keywords

Artificial intelligencebibliographycombinatorial optimizationconstraint logic programmingevolutionary computationgenetic algorithmsgreedy random adaptive search procedureheuristicshybridslocal searchmetaheuristicsneural networksnon-monotonic search strategiesproblem-space methodsimulated annealingtabu searchthreshold algorithms

Copyright information

© J.C. Baltzer AG, Science Publishers 1996

Authors and Affiliations

  • Ibrahim H. Osman
    • 1
  • Gilbert Laporte
    • 2
  1. 1.Institute of Mathematics and StatisticsUniversity of KentCanterburyUK
  2. 2.Centre de recherche sur les transportsUniversité de MontréalMontréalCanada