Hybrid metaheuristics in combinatorial optimization: A surveyReport as inadecuate

Hybrid metaheuristics in combinatorial optimization: A survey - Download this document for free, or read online. Document in PDF available to download.

1 UPC - Universitat Politècnica de Catalunya Barcelona 2 AIT - Austrian Institute of Technology Vienna 3 Vienna University of Technology Vienna 4 UNIBO - Università di Bologna Bologna

Abstract : Research in metaheuristics for combinatorial optimization problems has lately experienced a noteworthy shift towards the hybridization of metaheuristics with other techniques for optimization. At the same time, the focus of research has changed from being rather algorithm-oriented to being more problem-oriented. Nowadays the focus is on solving the problem at hand in the best way possible , rather than promoting a certain metaheuristic. This has led to an enormously fruitful cross-fertilization of different areas of optimization. This cross-fertilization is documented by a multitude of powerful hybrid algorithms that were obtained by combining components from several different optimization techniques. Hereby, hybridization is not restricted to the combination of different metaheuristics but includes, for example, the combination of exact algorithms and metaheuristics. In this work we provide a survey of some of the most important lines of hybridization. The literature review is accompanied by the presentation of illustrative examples.

Keywords : Local search Constraint programming Mathematical programming Combinatorial optimization Hybrid metaheuristics

Author: Christian Blum - Jakob Puchinger - Günther Raidl - Andrea Roli -

Source: https://hal.archives-ouvertes.fr/


Related documents