Optimization problems are of great importance across a broad range
of fields. They can be tackled, for example, by approximate
algorithms such as metaheuristics. This book is intended both to
provide an overview of hybrid metaheuristics to novices of the
field, and to provide researchers from the field with a collection
of some of the most interesting recent developments. The authors
involved in this book are among the top researchers in their
domain.Optimization problems are of great importance in many
fields. They can be tackled, for example, by approximate algorithms
such as metaheuristics. Examples of metaheuristics are simulated
annealing, tabu search, evolutionary computation, iterated local
search, variable neighborhood search, and ant colony optimization.
In recent years it has become evident that a skilled combination of
a metaheuristic with other optimization techniques, a so called
hybrid metaheuristic, can provide a more efficient behavior and a
higher flexibility. This is because hybrid metaheuristics combine
their advantages with the complementary strengths of, for example,
more classical optimization techniques such as branch and bound or
dynamic programming.
The authors involved in this book are among the top researchers in
their domain. The book is intended both to provide an overview of
hybrid metaheuristics to novices of the field, and to provide
researchers from the field with a collection of some of the most
interesting recent developments.
Ausstattung/Bilder: 2010. X, 290 S. 55 SW-Abb., 18 Tabellen. 235 mm
Seitenzahl: 300
Studies in Computational Intelligence 114
Best.Nr. des Verlages: 12895809
Englisch
Abmessung: 235mm x 155mm x 16mm
Gewicht: 456g
ISBN-13: 9783642096976
ISBN-10: 3642096972
Best.Nr.: 32058371
Inhaltsangabe
Hybrid Metaheuristics: An Introduction.- Combining (Integer) Linear Programming Techniques and Metaheuristics for Combinatorial Optimization.- The Relation Between Complete and Incomplete Search.- Hybridizations of Metaheuristics With Branch and Bound Derivates.- Very Large-Scale Neighborhood Search: Overview and Case Studies on Coloring Problems.- Hybrids of Constructive Metaheuristics and Constraint Programming: A Case Study with ACO.- Hybrid Metaheuristics for Packing Problems.- Hybrid Metaheuristics for Multi-objective Combinatorial Optimization.- Multilevel Refinement for Combinatorial Optimisation: Boosting Metaheuristic Performance.