Overview
- Authors among the leading researchers in this domain
- Reflects the shift to problem-oriented rather than algorithm-oriented approaches
- Valuable for researchers and graduate students in optimization, algorithmics, mathematical modeling, operations research, statistics, and simulation
Part of the book series: Artificial Intelligence: Foundations, Theory, and Algorithms (AIFTA)
Access this book
Tax calculation will be finalised at checkout
Other ways to access
Table of contents (7 chapters)
-
Front Matter
-
Back Matter
Keywords
About this book
This book explains the most prominent and some promising new, general techniques that combine metaheuristics with other optimization methods. A first introductory chapter reviews the basic principles of local search, prominent metaheuristics, and tree search, dynamic programming, mixed integer linear programming, and constraint programming for combinatorial optimization purposes. The chapters that follow present five generally applicable hybridization strategies, with exemplary case studies on selected problems: incomplete solution representations and decoders; problem instance reduction; large neighborhood search; parallel non-independent construction of solutions within metaheuristics; and hybridization based on complete solution archives.
The authors are among the leading researchers in the hybridization of metaheuristics with other techniques for optimization, and their work reflects the broad shift to problem-oriented rather than algorithm-oriented approaches, enabling faster and more effective implementation in real-life applications. This hybridization is not restricted to different variants of metaheuristics but includes, for example, the combination of mathematical programming, dynamic programming, or constraint programming with metaheuristics, reflecting cross-fertilization in fields such as optimization, algorithmics, mathematical modeling, operations research, statistics, and simulation. The book is a valuable introduction and reference for researchers and graduate students in these domains.
Reviews
“This book by Blum and Raidl constructs a bridge between these two approaches and aims to share expertise gained from each end. … The book is well-structured. … I highly recommend this book,both to practitioners and theoreticians at the post graduate levels, be they rooted either at the ‘formal/rigid’ or ‘heuristic/soft’ ends of Combinatorial Optimization research or practice.” (Ofer M. Shir, Genetic Programming and Evolvable Machines, Vol. 19 (1-2), June, 2018)
Authors and Affiliations
About the authors
Bibliographic Information
Book Title: Hybrid Metaheuristics
Book Subtitle: Powerful Tools for Optimization
Authors: Christian Blum, Günther R. Raidl
Series Title: Artificial Intelligence: Foundations, Theory, and Algorithms
DOI: https://doi.org/10.1007/978-3-319-30883-8
Publisher: Springer Cham
eBook Packages: Computer Science, Computer Science (R0)
Copyright Information: Springer International Publishing Switzerland 2016
Hardcover ISBN: 978-3-319-30882-1Published: 31 May 2016
Softcover ISBN: 978-3-319-80907-6Published: 30 May 2018
eBook ISBN: 978-3-319-30883-8Published: 23 May 2016
Series ISSN: 2365-3051
Series E-ISSN: 2365-306X
Edition Number: 1
Number of Pages: XVI, 157
Number of Illustrations: 11 b/w illustrations, 9 illustrations in colour
Topics: Artificial Intelligence, Theory of Computation, Computational Intelligence, Operations Research/Decision Theory, Optimization