Overview
- Editors:
-
-
Fred Glover
-
Leeds School of Business, University of Colorado at Boulder, USA
-
Gary A. Kochenberger
-
College of Business, University of Colorado at Denver, USA
Access this book
Other ways to access
Table of contents (19 chapters)
-
-
- Fred Glover, Manuel Laguna, Rafael Marti
Pages 1-35
-
-
-
-
- Pablo Moscato, Carlos Cotta
Pages 105-144
-
- Pierre Hansen, Nenad Mladenović
Pages 145-184
-
- Christos Voudouris, Edward P. K. Tsang
Pages 185-218
-
- Mauricio G. C. Resende, Celso C. Ribeiro
Pages 219-249
-
- Marco Dorigo, Thomas Stützle
Pages 250-285
-
- Darrall Henderson, Sheldon H. Jacobson, Alan W. Johnson
Pages 287-319
-
- Helena R. Lourenço, Olivier C. Martin, Thomas Stützle
Pages 320-353
-
-
- Filippo Focacci, François Laburthe, Andrea Lodi
Pages 369-403
-
- Eugene C. Freuder, Mark Wallace
Pages 405-428
-
- Jean-Yves Potvin, Kate A. Smith
Pages 429-455
-
- Edmund Burke, Graham Kendall, Jim Newall, Emma Hart, Peter Ross, Sonia Schulenburg
Pages 457-474
-
- Teodor Gabriel Crainic, Michel Toulouse
Pages 475-513
-
- Andreas Fink, Stefan Voß, David L. Woodruff
Pages 515-535
-
- Sarosh Talukdar, Sesh Murthy, Rama Akkiraju
Pages 537-556
About this book
Metaheuristics, in their original definition, are solution methods that orchestrate an interaction between local improvement procedures and higher level strategies to create a process capable of escaping from local optima and performing a robust search of a solution space. Over time, these methods have also come to include any procedures that employ strategies for overcoming the trap of local optimality in complex solution spaces, especially those procedures that utilize one or more neighborhood structures as a means of defining admissible moves to transition from one solution to another, or to build or destroy solutions in constructive and destructive processes. The degree to which neighborhoods are exploited varies according to the type of procedure. In the case of certain population-based procedures, such as genetic al- rithms, neighborhoods are implicitly (and somewhat restrictively) defined by reference to replacing components of one solution with those of another, by variously chosen rules of exchange popularly given the name of “crossover. ” In other population-based methods, based on the notion of path relinking, neighborhood structures are used in their full generality, including constructive and destructive neighborhoods as well as those for transitioning between (complete) solutions. Certain hybrids of classical evoluti- ary approaches, which link them with local search, also use neighborhood structures more fully, though apart from the combination process itself.
Reviews
From the reviews:
"The ‘Handbook of Metaheuristics’ consists of 19 chapters each describing one metaheuristic. Every chapter is authored by one or more experts in the individual field … . I am satisfied that their individual contents are of high quality. … So, in short, an excellent book if you want to learn about a number of individual metaheuristics." (U Aickelin, Journal of the Operational Research Society, Issue 56, 2005)
Editors and Affiliations
-
Leeds School of Business, University of Colorado at Boulder, USA
Fred Glover
-
College of Business, University of Colorado at Denver, USA
Gary A. Kochenberger
