http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-2.xsd
XX, 604 p. 98 illus., 56 illus. in color. online resource.
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.
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.
edited by Michel Gendreau, Jean-Yves Potvin.
International Series in Operations Research & Management Science, 272