Metaheuristics in combinatorial optimization: Overview and conceptual comparison

被引:1982
作者
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
相关论文
共 174 条
  • [151] SPEARS WM, 1993, P EUR C MACH LEARN E, V667, P442
  • [152] Landscapes and their correlation functions
    Stadler, PF
    [J]. JOURNAL OF MATHEMATICAL CHEMISTRY, 1996, 20 (1-2) : 1 - 45
  • [153] Stadler PF, 1995, LECT NOTES PHYS, V461, P78
  • [154] MAX-MIN Ant System
    Stützle, T
    Hoos, HH
    [J]. FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE, 2000, 16 (08): : 889 - 914
  • [155] STUTZLE T, 1999, THESIS DISKI SANKT A
  • [156] STUTZLE T, 1999, AIDA9903 TU DARMST F
  • [157] SYSWERDA G, 1993, FOUNDATIONS OF GENETIC ALGORITHMS 2, P239
  • [158] ROBUST TABOO SEARCH FOR THE QUADRATIC ASSIGNMENT PROBLEM
    TAILLARD, E
    [J]. PARALLEL COMPUTING, 1991, 17 (4-5) : 443 - 455
  • [159] A taxonomy of hybrid metaheuristics
    Talbi, EG
    [J]. JOURNAL OF HEURISTICS, 2002, 8 (05) : 541 - 564
  • [160] Toulouse M, 1999, LECT NOTES COMPUT SC, V1685, P533