Metaheuristics for Hard Optimization: Simulated Annealing, Tabu Search, Evolutionary and Genetic Algorithms, Ant Colonies,… Methods and Case Studies

✍ Scribed by Johann Dréo, Professor Patrick Siarry, Alain Pétrowski, Professor Eric Taillard (auth.)

• Publisher: Springer-Verlag Berlin Heidelberg
• Year: 2006
• Tongue: English
• Leaves: 350
• Edition: 1
• Category: Library

✦ Synopsis

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,

• tabu search,

• the evolutionary algorithms,

• 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.

✦ Table of Contents

Introduction....Pages 1-19
Simulated Annealing....Pages 23-46
Tabu Search....Pages 47-73
Evolutionary Algorithms....Pages 75-122
Ant Colony Algorithms....Pages 123-150
Some Other Metaheuristics....Pages 153-177
Extensions....Pages 179-224
Methodology....Pages 225-248
Optimization of UMTS Radio Access Networks with Genetic Algorithms....Pages 251-276
Genetic Algorithms Applied to Air Traffic Management....Pages 277-306
Constraint Programming and Ant Colonies Applied to Vehicle Routing Problems....Pages 307-326

✦ Subjects

Optimization; Operations Research/Decision Theory; Computing Methodologies; Appl.Mathematics/Computational Methods of Engineering; Engineering Economics, Organization, Logistics, Marketing; Control Engineering