作者
C Blum, G Raidl
发表日期
2011
期刊
Applied Soft Computing
卷号
11
期号
6
页码范围
4135-4151
简介
Publikationseintrag [Zurück] Zeitschriftenartikel: C. Blum, J. Puchinger, G. Raidl, A. Roli: "Hybrid metaheuristics in combinatorial optimization: A survey"; Applied Soft Computing, Volume 11 (2011), Issue 6; S. 4135 - 4151. Kurzfassung englisch: 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 …
学术搜索中的文章
C Blum, G Raidl - Applied Soft Computing, 2011
G Zach, A Nemecek, K Oberhauser, H Zimmermann - Energy and Buildings, 2012
B Thallner, H Moser, U Schmid - Wireless Networks, 2010
J Carrete, B Vermeersch, A Katre, A van Roekeghem… - Computer Physics Communications, 2017
IM Melendez, E Neubauer, H Danninger - PLoS ONE, 2015
G Hanappi, W Hummer, S Dustdar - Journal of Economic Issues, 2013
H Reisinger, M Zahlbruckner, I Kovacic, P Kán… - Acta Materialia, 2011
V Chepoi, N Creignou, M Hermann, G Salzer - European Journal of Combinatorics, 2010