, Volume 63, Issue 5, pp 511623
First online:
Metaheuristics: A bibliography
 Ibrahim H. OsmanAffiliated withInstitute of Mathematics and Statistics, University of Kent
 , Gilbert LaporteAffiliated withCentre de recherche sur les transports, Université de Montréal
Rent the article at a discount
Rent now* Final gross prices may vary according to local VAT.
Get AccessAbstract
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; nonmonotonic search strategies; spacesearch methods; simulated annealing; tabu search; threshold algorithms and their hybrids. References are presented in alphabetical order under a number of subheadings.
Keywords
Artificial intelligence bibliography combinatorial optimization constraint logic programming evolutionary computation genetic algorithms greedy random adaptive search procedure heuristics hybrids local search metaheuristics neural networks nonmonotonic search strategies problemspace method simulated annealing tabu search threshold algorithms Title
 Metaheuristics: A bibliography
 Journal

Annals of Operations Research
Volume 63, Issue 5 , pp 511623
 Cover Date
 199610
 DOI
 10.1007/BF02125421
 Print ISSN
 02545330
 Online ISSN
 15729338
 Publisher
 Baltzer Science Publishers, Baarn/Kluwer Academic Publishers
 Additional Links
 Topics
 Keywords

 Artificial intelligence
 bibliography
 combinatorial optimization
 constraint logic programming
 evolutionary computation
 genetic algorithms
 greedy random adaptive search procedure
 heuristics
 hybrids
 local search
 metaheuristics
 neural networks
 nonmonotonic search strategies
 problemspace method
 simulated annealing
 tabu search
 threshold algorithms
 Industry Sectors
 Authors

 Ibrahim H. Osman ^{(1)}
 Gilbert Laporte ^{(2)}
 Author Affiliations

 1. Institute of Mathematics and Statistics, University of Kent, CT2 7NF, Canterbury, Kent, UK
 2. Centre de recherche sur les transports, Université de Montréal, Succursale Centreville, Case postable 6128, H3C 3J7, Montréal, Canada