Metaheuristics in combinatorial optimization: Overview and conceptual comparison

被引:1922
|
作者
Blum, C
Roli, A
机构
[1] Free Univ Brussels, IRIDIA, B-1050 Brussels, Belgium
[2] Univ Bologna, DEIA, Bologna, Italy
关键词
algorithms; metaheuristics; combinatorial optimization; intensification; diversification;
D O I
10.1145/937503.937505
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
The field of metaheuristics for the application to combinatorial optimization problems is a rapidly growing field of research. This is due to the importance of combinatorial optimization problems for the scientific as well as the industrial world. We give a survey of the nowadays most important metaheuristics from a conceptual point of view. We outline the different components and concepts that are used in the different metaheuristics in order to analyze their similarities and differences. Two very important concepts in metaheuristics are intensification and diversification. These are the two forces that largely determine the behavior of a metaheuristic. They are in some way contrary but also complementary to each other. We introduce a framework, that we call the I&D frame, in order to put different intensification and diversification components into relation with each other. Outlining the advantages and disadvantages of different metaheuristic approaches we conclude by pointing out the importance of hybridization of metaheuristics as well as the integration of metaheuristics and other methods for optimization.
引用
收藏
页码:268 / 308
页数:41
相关论文
共 50 条
  • [31] Multi-objectivization inspired metaheuristics for the sum-of-the-parts combinatorial optimization problems
    Shi, Jialong
    Sun, Jianyong
    Zhang, Qingfu
    APPLIED SOFT COMPUTING, 2021, 103
  • [32] An overview of mean field theory in combinatorial optimization problems
    Kasap, S
    Trafalis, TB
    GLOBAL ANALYSIS AND APPLIED MATHEMATICS, 2004, 729 : 339 - 346
  • [33] Bee-inspired metaheuristics for global optimization: a performance comparison
    Solgi, Ryan
    Loaiciga, Hugo A.
    ARTIFICIAL INTELLIGENCE REVIEW, 2021, 54 (07) : 4967 - 4996
  • [34] Overview of metaheuristics methods in compilation
    Kri, F
    Gómez, C
    Caro, P
    MICAI 2005: ADVANCES IN ARTIFICIAL INTELLIGENCE, 2005, 3789 : 483 - 493
  • [35] Bee-inspired metaheuristics for global optimization: a performance comparison
    Ryan Solgi
    Hugo A. Loáiciga
    Artificial Intelligence Review, 2021, 54 : 4967 - 4996
  • [36] A new machine learning based approach for tuning metaheuristics for the solution of hard combinatorial optimization problems
    Zennaki M.
    Ech-Cherif A.
    Journal of Applied Sciences, 2010, 10 (18) : 1991 - 2000
  • [37] Teaching modern heuristics in combinatorial optimization - The example of a demonstration and research tool employing metaheuristics in scheduling
    Geiger, Martin Josef
    EDUCATION FOR THE 21ST CENTURY - IMPACT OF ICT AND DIGITAL RESOURCES, 2006, 210 : 65 - 74
  • [38] A basic study of metaheuristics based on higher level structure in solution space of combinatorial optimization problems
    Kanazawa T.
    Yasuda K.
    IEEJ Transactions on Electronics, Information and Systems, 2011, 131 (04) : 934 - 935
  • [39] Combinatorial metaheuristics applied to infectious disease models
    Jose Fallas-Monge, Juan
    Chavarria-Molina, Jeffry
    Alpizar-Brenes, Geisel
    2016 IEEE 36TH CENTRAL AMERICAN AND PANAMA CONVENTION (CONCAPAN XXXVI), 2016,
  • [40] Metaheuristics for Portfolio Optimization
    El-Bizri, Sarah
    Mansour, Nashat
    ADVANCES IN SWARM INTELLIGENCE, ICSI 2017, PT II, 2017, 10386 : 77 - 84