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.
%0 Journal Article
%1 osman:1996
%A Osman, Ibrahim
%A Laporte, Gilbert
%D 1996
%I Springer Netherlands
%J Annals of Operations Research
%K algorithms, approximate, metaheuristics, optimization, search
%N 5
%P 511--623
%R 10.1007/BF02125421
%T Metaheuristics: A bibliography
%U http://dx.doi.org/10.1007/BF02125421
%V 63
%X 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.
@article{osman:1996,
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.}},
added-at = {2012-03-02T03:39:18.000+0100},
author = {Osman, Ibrahim and Laporte, Gilbert},
biburl = {https://www.bibsonomy.org/bibtex/2094faebc57b293ca95c1e719e038cc74/baby9992006},
citeulike-article-id = {9435357},
citeulike-linkout-0 = {http://dx.doi.org/10.1007/BF02125421},
citeulike-linkout-1 = {http://www.springerlink.com/content/v0872p6k2086186w},
day = 28,
doi = {10.1007/BF02125421},
interhash = {2f47de8abab6a608d47ca466830c134b},
intrahash = {094faebc57b293ca95c1e719e038cc74},
issn = {0254-5330},
journal = {Annals of Operations Research},
keywords = {algorithms, approximate, metaheuristics, optimization, search},
month = oct,
number = 5,
pages = {511--623},
posted-at = {2012-02-23 12:36:24},
priority = {2},
publisher = {Springer Netherlands},
timestamp = {2012-03-02T03:39:21.000+0100},
title = {{Metaheuristics: A bibliography}},
url = {http://dx.doi.org/10.1007/BF02125421},
volume = 63,
year = 1996
}