Journal
APPLIED SOFT COMPUTING
Volume 11, Issue 6, Pages 4135-4151Publisher
ELSEVIER
DOI: 10.1016/j.asoc.2011.02.032
Keywords
Hybrid metaheuristics; Combinatorial optimization; Mathematical programming; Constraint programming; Local search
Categories
Funding
- Spanish government [TIN2007-66523]
- Austrian Science Fund (FWF) [P20342-N13]
- Spanish Ministry of Science and Innovation
- Austrian Science Fund (FWF) [P20342] Funding Source: Austrian Science Fund (FWF)
Ask authors/readers for more resources
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. (C) 2011 Elsevier B.V. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available