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 条
  • [21] Multi-Objective Combinatorial Optimization of Trigeneration Plants Based on Metaheuristics
    Stojiljkovic, Mirko M.
    Stojiljkovic, Mladen M.
    Blagojevic, Bratislav D.
    ENERGIES, 2014, 7 (12): : 8554 - 8581
  • [22] An overview of computational issues in combinatorial optimization
    Laureano F. Escudero
    Silvano Martello
    Vitaly Strusevich
    Annals of Operations Research, 2013, 207 : 1 - 5
  • [23] An overview of computational issues in combinatorial optimization
    Escudero, Laureano F.
    Martello, Silvano
    Strusevich, Vitaly
    ANNALS OF OPERATIONS RESEARCH, 2013, 207 (01) : 1 - 5
  • [24] A review of simheuristics: Extending metaheuristics to deal with stochastic combinatorial optimization problems
    Juan, Angel A.
    Faulin, Javier
    Grasman, Scott E.
    Rabe, Markus
    Figueira, Goncalo
    OPERATIONS RESEARCH PERSPECTIVES, 2015, 2 : 62 - 72
  • [25] Introductory overview: Optimization using evolutionary algorithms and other metaheuristics
    Maier, H. R.
    Razavi, S.
    Kapelan, Z.
    Matott, L. S.
    Kasprzyk, J.
    Tolson, B. A.
    ENVIRONMENTAL MODELLING & SOFTWARE, 2019, 114 : 195 - 213
  • [26] Chaotic Binarization Schemes for Solving Combinatorial Optimization Problems Using Continuous Metaheuristics
    Cisternas-Caneo, Felipe
    Crawford, Broderick
    Soto, Ricardo
    Giachetti, Giovanni
    Paz, Alex
    Pena Fritz, Alvaro
    MATHEMATICS, 2024, 12 (02)
  • [27] Evolutionary game dynamics in combinatorial optimization: An overview
    Pelillo, M
    APPLICATIONS OF EVOLUTIONARY COMPUTING, PROCEEDINGS, 2001, 2037 : 182 - 192
  • [28] An overview of advances in combinatorial optimization related topics
    Martello, Silvano
    Weber, Gerhard-Wilhelm
    Kasimbeyli, Refail
    OPTIMIZATION, 2013, 62 (10) : 1291 - 1295
  • [29] Comparison of metaheuristics and dynamic programming for district energy optimization
    Ikeda, Shintaro
    Ooka, Ryozo
    SUSTAINABLE BUILT ENVIRONMENT CONFERENCE 2019 TOKYO (SBE19TOKYO) - BUILT ENVIRONMENT IN AN ERA OF CLIMATE CHANGE: HOW CAN CITIES AND BUILDINGS ADAPT?, 2019, 294