期刊
APPLIED SOFT COMPUTING
卷 11, 期 6, 页码 4135-4151出版社
ELSEVIER
DOI: 10.1016/j.asoc.2011.02.032
关键词
Hybrid metaheuristics; Combinatorial optimization; Mathematical programming; Constraint programming; Local search
资金
- 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)
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.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据