|
|||||
|
|
Metaheuristics: A bibliography |
|
| Authors: | Ibrahim H. Osman Gilbert Laporte |
| Affiliation: | (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 Centre-ville, Case postable 6128, H3C 3J7 Montréal, Canada |
| 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 intelligence bibliography combinatorial optimization constraint logic programming evolutionary computation genetic algorithms greedy random adaptive search procedure heuristics hybrids local search metaheuristics neural networks non-monotonic search strategies problem-space method simulated annealing tabu search threshold algorithms |
| 本文献已被 SpringerLink 等数据库收录！ | |