Rigorous Analyses for the Combination of Ant Colony Optimization and Local Search

被引:0
|
作者
Neumann, Frank [1 ]
Sudholt, Dirk [2 ]
Witt, Carsten [2 ]
机构
[1] Max Planck Inst Informat, Saarbrucken, Germany
[2] Tech Univ Dortmund, Informat 2, Dortmund, Germany
关键词
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Ant colony optimization (ACO) is a metaheuristic that produces good results for a wide range of combinatorial optimization problems. Often such successful applications use a combination of ACO and local search procedures that improve the solutions constructed by the ants. In this paper, we study this combination from a theoretical point of view and point out situations where introducing local search into an ACO algorithm enhances the optimization process significantly. On the other hand, we illustrate the drawback that such a combination might have by showing that this may prevent all ACO algorithm from obtaining optimal solutions.
引用
收藏
页码:132 / +
页数:2
相关论文
共 50 条
  • [1] Ant Colony Optimization with Local Search for Continuous Functions
    Qi, Chengming
    [J]. ADVANCED RESEARCH ON INDUSTRY, INFORMATION SYSTEMS AND MATERIAL ENGINEERING, PTS 1-7, 2011, 204-210 : 1135 - 1138
  • [2] An Incremental Ant Colony Algorithm with Local Search for Continuous Optimization
    Liao, Tianjun
    de Oca, Marco A. Montes
    Aydin, Dogan
    Stutzle, Thomas
    Dorigo, Marco
    [J]. GECCO-2011: PROCEEDINGS OF THE 13TH ANNUAL GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE, 2011, : 125 - 132
  • [3] Ant Colony Optimization for Feature Selection Involving Effective Local Search
    Kabir, Md Monirul
    Shahjahan, Md
    Murase, Kazuyuki
    [J]. JOURNAL OF ADVANCED COMPUTATIONAL INTELLIGENCE AND INTELLIGENT INFORMATICS, 2011, 15 (06) : 671 - 680
  • [4] Ant Colony Optimization With Local Search for Dynamic Traveling Salesman Problems
    Mavrovouniotis, Michalis
    Muller, Felipe M.
    Yang, Shengxiang
    [J]. IEEE TRANSACTIONS ON CYBERNETICS, 2017, 47 (07) : 1743 - 1756
  • [5] Improved Ant Colony Optimization with Local Search for Traveling Salesman Problem
    Thammano, Arit
    Oonsrikaw, Yindee
    [J]. 2019 20TH IEEE/ACIS INTERNATIONAL CONFERENCE ON SOFTWARE ENGINEERING, ARTIFICIAL INTELLIGENCE, NETWORKING AND PARALLEL/DISTRIBUTED COMPUTING (SNPD), 2019, : 22 - 27
  • [6] Local Search based Ant Colony Optimization for Scheduling in Cloud Computing
    Gondhi, Naveen Kumar
    Sharma, Aditya
    [J]. 2015 SECOND INTERNATIONAL CONFERENCE ON ADVANCES IN COMPUTING AND COMMUNICATION ENGINEERING ICACCE 2015, 2015, : 432 - 436
  • [7] Ant colony optimization and local search for bin packing and cutting stock problems
    Levine, J
    Ducatelle, F
    [J]. JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2004, 55 (07) : 705 - 716
  • [8] A New Local Search Based Ant Colony Optimization Algorithm for Solving Combinatorial Optimization Problems
    Hassan, Md. Rakib
    Islam, Md. Monirul
    Murase, Kazuyuki
    [J]. IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2010, E93D (05): : 1127 - 1136
  • [9] Scalable unit commitment by memory-bounded ant colony optimization with A* local search
    Saber, Ahmed Yousuf
    Alshareef, Abdulaziz Mohammed
    [J]. INTERNATIONAL JOURNAL OF ELECTRICAL POWER & ENERGY SYSTEMS, 2008, 30 (6-7) : 403 - 414
  • [10] Incremental local search in ant colony optimization:: Why it fails for the quadratic assignment problem
    Balaprakash, Prasanna
    Birattari, Mauro
    Stutzle, Thomas
    Dorigo, Marco
    [J]. ANT COLONY OPTIMIZATION AND SWARM INTELLIGENCE, PROCEEDINGS, 2006, 4150 : 156 - 166