Skip to Main content Skip to Navigation
Journal articles

Hybrid metaheuristics in combinatorial optimization: A survey

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.
Document type :
Journal articles
Complete list of metadata

Cited literature [150 references]  Display  Hide  Download
Contributor : Jakob Puchinger Connect in order to contact the contributor
Submitted on : Wednesday, November 4, 2015 - 11:17:44 PM
Last modification on : Thursday, October 14, 2021 - 3:02:10 AM
Long-term archiving on: : Friday, February 5, 2016 - 11:38:23 AM


Files produced by the author(s)




Christian Blum, Jakob Puchinger, Günther R. Raidl, Andrea Roli. Hybrid metaheuristics in combinatorial optimization: A survey. Applied Soft Computing, Elsevier, 2011, 11 (6), pp.4135-4151. ⟨10.1016/j.asoc.2011.02.032⟩. ⟨hal-01224683⟩



Record views


Files downloads