The third edition of this handbook is designed to provide a broad coverage of the concepts, implementations, and applications in metaheuristics. The book's chapters serve as stand-alone presentations giving both the necessary underpinnings as well as practical guides for implementation. The nature of metaheuristics invites an analyst to modify basic methods in response to problem characteristics, past experiences, and personal preferences, and the chapters in this handbook are designed to facilitate this process as well. This new edition has been fully revised and features new chapters on swarm intelligence and automated design of metaheuristics from flexible algorithm frameworks. The authors who have contributed to this volume represent leading figures from the metaheuristic community and are responsible for pioneering contributions to the fields they write about. Their collective work has significantly enriched the field of optimization in general and combinatorial optimization in particular. Metaheuristics 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. In addition, many new and exciting developments and extensions have been observed in the last few years. Hybrids of metaheuristics with other optimization techniques, like branch-and-bound, mathematical programming or constraint programming are also increasingly popular. On the front of applications, metaheuristics are now used to find high-quality solutions to an ever-growing number of complex, ill-defined real-world problems, in particular combinatorial ones. This handbook should continue to be a great reference for researchers, graduate students, as well as practitioners interested in metaheuristics.

Autorentext
Michel Gendreau is Department Chair and Professor of Operations Research in the Department of Mathematics and Industrial Engineering of Polytechnique Montréal (Canada). He received his Ph.D. from University of Montreal in 1984. His main research area is the application of operations research methods to a wide range of problem areas: transportation and logistics systems planning and operation, energy production and storage, healthcare, and telecommunications. Dr. Gendreau has published more than 300 papers in peer-reviewed journals and conference proceedings. He was the Editor in chief of Transportation Science from 2009 to 2014 and he is a member of several other editorial boards. Dr. Gendreau has received several research grants and awards, including the Robert Herman Lifetime Achievement Award of the Transportation Science & Logistics Society of INFORMS and the Merit Award of the Canadian Operational Research Society. He was elected Fellow of INFORMS in 2010.Jean-Yves Potvin is Professor at Université de Montréal in the Department of Computer Science and Operations Research. He is also Assistant Director of the Interuniversity Research Centre on Enterprise Networks, Logistics and Transportation (CIRRELT). His research integrates operations research and artificial intelligence techniques. More precisely, he is interested in the development of adaptive algorithms based on local search-based metaheuristics, genetic algorithms and neural networks to address different types of vehicle routing problems. He also works on parallel implementations of these algorithms for real-time applications, like dynamic vehicle dispatching.

Zusammenfassung
The rst edition of the Handbook of Metaheuristics was published in 2003 under the editorship of Fred Glover and Gary A. Kochenberger. Given the numerous - velopments observed in the eld of metaheuristics in recent years, it appeared that the time was ripe for a second edition of the Handbook. For different reasons, Fred and Gary were unable to accept Springer's invitation to prepare this second e- tion and they suggested that we should take over the editorship responsibility of the Handbook. We are deeply honored and grateful for their trust. As stated in the rst edition, metaheuristics are solution methods that orch- trate an interaction between local improvement procedures and higher level stra- gies to create a process capable of escaping from local optima and performing a robust search of a solution space. Although this broad characterization still holds today, many new and exciting developments and extensions have been observed in the last few years. We think in particular to hybrids, which take advantage of the strengths of each of their individual metaheuristic components to better explore the solution space. Hybrids of metaheuristics with other optimization techniques, like branch-and-bound, mathematical programming or constraint programming are also increasingly popular. On the front of applications, metaheuristics are now used to nd high-quality solutions to an ever-growing number of complex, ill-de ned re- world problems, in particular combinatorial ones.

Inhalt

Chapter 1. Simulated Annealing: From Basics to Applications.- Chapter 2. Tabu Search.- Chapter 3. Variable Neighborhood Search.- Chapter 4. Large Neighborhood Search.- Chapter 5. Iterated Local Search: Framework and Applications.- Chapter 6. Greedy Randomized Adaptive Search Procedures: Advances and Extensions.- Chapter 7. Intelligent Multi-Start Methods.- Chapter 8. Next Generation Genetic Algorithms: A User's Guide and Tutorial.- Chapter 9. An Accelerated Introduction to Memetic Algorithms.- Chapter 10. Ant Colony Optimization: Overview and Recent Advances.- Chapter 11. Swarm Intelligence.- Chapter 12. Metaheuristic Hybrids.- Chapter 13. Parallel Metaheuristics and Cooperative Search.- Chapter 14. A Classification of Hyper-heuristic Approaches Revisited.- Chapter 15. Reactive Search Optimization: Learning while Optimizing.- Chapter 16. Stochastic Search in Metaheuristics.- Chapter 17. Automated Design of Metaheuristic Algorithms.- Chapter 18. Computational Comparison of Metaheuristics.