Metaheuristics for Hard Optimization
Methods and Case Studies
Johann Dréo, Alain Pétrowski, Patrick Siarry & Eric Taillard
Book coordinated by Patrick Siarry
SPRINGER
ISBN 3-540-23022-X. December 2005.
369 p. 140 illus. Hardcover
Recommended Retail Price: US $ 99.00
http://www.springer.com/sgw/cda/frontpage/0,11855,4-40109-22-52101430-
0,00.html
Metaheuristics for Hard Optimization comprises of three parts.
The first part is devoted to the detailed presentation of the four most
widely known metaheuristics: the simulated annealing method, the tabu
search, the evolutionary and the genetic algorithms, the ant colony
algorithms. Each one of these metaheuristics is actually a family of
methods, of which the essential elements are discussed.
In the second part, the book presents some other less widespread
metaheuristics, then extensions of metaheuristics and some ways of
research are described . The problem of the choice of a metaheuristic is
posed and solution methods are discussed.
The last part concentrates on three case studies from telecommunications,
air traffic control, and vehicle routing.
Keywords: Metaheuristics, Multiobjective optimization, Global
optimization.
Contents:
Introduction.- Simulated annealing.- Tabu search.- Evolutionary
algorithms.- Ant colony algorithms.- Some other metaheuristics.-
Extensions.- Methodology.- Optimization of UMTS radio access networks with
genetic algorithms.- Genetic algorithms applied to air traffic management.-
Constraint programming and ant colonies applied to vehicle routing
problems.- Conclusion.- Appendix A: modeling of simulated annealing
through the Markov chain formalism.- Appendix B : complete example of
implementation of tabu search for the Quadratic Assignment Problem.-
References.- Index.
|