Hybrid Metaheuristics: An Emerging Approach to Optimization

Front Cover
Christian Blum, Andrea Roli, Michael Sampels
Springer Science & Business Media, Apr 11, 2008 - Mathematics - 290 pages

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.

 

What people are saying - Write a review

We haven't found any reviews in the usual places.

Selected pages

Contents

An Introduction
1
Combining Integer Linear Programming Techniques and Metaheuristics for Combinatorial Optimization
31
The Relation Between Complete and Incomplete Search
63
Hybridizations of Metaheuristics With Branch Bound Derivates
85
Overview and Case Studies on Coloring Problems
117
A Case Study with ACO
151
Hybrid Metaheuristics for Packing Problems
184
Hybrid Metaheuristics for Multiobjective Combinatorial Optimization
221
Boosting Metaheuristic Performance
260
Copyright

Other editions - View all

Common terms and phrases

Bibliographic information