A comparison between ACO algorithms for the set covering problem

被引：0
|
作者：
Lessing, L [1 ]
Dumitrescu, I [1 ]
Stützle, T [1 ]
机构：
[1] Tech Univ Darmstadt, Intelligent Grp, Darmstadt, Germany
来源：
ANT COLONY OPTIMIZATION AND SWARM INTELLIGENCE, PROCEEDINGS | 2004年 / 3172卷
关键词：
D O I：
暂无
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
In this paper we present a study of several Ant Colony Optimization (ACO) algorithms for the Set Covering Problem. In our computational study we emphasize the influence of different ways of defining the heuristic information on the performance of the ACO algorithms. Finally, we show that the best performing ACO algorithms we implemented, when combined with a fine-tuned local search procedure, reach excellent performance on a set of well known benchmark instances.
引用
收藏
页码：1 / 12
页数：12
相关论文
共 50 条
  • [41] A heuristic method for the set covering problem
    Caprara, A
    Fischetti, M
    Toth, P
    OPERATIONS RESEARCH, 1999, 47 (05) : 730 - 743
  • [42] The probabilistic set-covering problem
    Beraldi, P
    Ruszczynski, A
    OPERATIONS RESEARCH, 2002, 50 (06) : 956 - 967
  • [43] Requiring Connectivity in the Set Covering Problem
    J. Orestes Cerdeira
    Leonor S. Pinto
    Journal of Combinatorial Optimization, 2005, 9 : 35 - 47
  • [44] Requiring connectivity in the set covering problem
    Cerdeira, JO
    Pinto, LS
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2005, 9 (01) : 35 - 47
  • [45] Constructive Metaheuristics for the Set Covering Problem
    Crawford, Broderick
    Soto, Ricardo
    Astorga, Gino
    Garcia, Jose
    BIOINSPIRED OPTIMIZATION METHODS AND THEIR APPLICATIONS, BIOMA 2018, 2018, 10835 : 88 - 99
  • [46] A comparison between ACO and Dijkstra algorithms for optimal ore concentrate pipeline routing
    Baeza, Daniel
    Ihle, Christian F.
    Ortiz, Julian M.
    JOURNAL OF CLEANER PRODUCTION, 2017, 144 : 149 - 160
  • [47] Efficient algorithms for the conditional covering problem
    Benkoczi, Robert
    Bhattacharya, Binay
    Hu, Yuzhuang
    Lin, Chien-Hsin
    Shi, Qiaosheng
    Wang, Biing-Feng
    INFORMATION AND COMPUTATION, 2012, 219 : 39 - 57
  • [48] A Comparison of Learnheuristics Using Different Reward Functions to Solve the Set Covering Problem
    Crawford, Broderick
    Soto, Ricardo
    Cisternas-Caneo, Felipe
    Tapia, Diego
    de la Fuente-Mella, Hanns
    Palma, Wenceslao
    Lemus-Romani, Jose
    Castillo, Mauricio
    Becerra-Rozas, Marcelo
    OPTIMIZATION AND LEARNING, OLA 2021, 2021, 1443 : 74 - 85
  • [49] A Comparison of Three Recent Nature-Inspired Metaheuristics for the Set Covering Problem
    Crawford, Broderick
    Soto, Ricardo
    Pena, Cristian
    Riquelme-Leiva, Marco
    Torres-Rojas, Claudio
    Misra, Sanjay
    Johnson, Franklin
    Paredes, Fernando
    COMPUTATIONAL SCIENCE AND ITS APPLICATIONS - ICCSA 2015, PT IV, 2015, 9158 : 431 - 443
  • [50] Approximation algorithms for the covering Steiner problem
    Konjevod, G
    Ravi, R
    Srinivasan, A
    RANDOM STRUCTURES & ALGORITHMS, 2002, 20 (03) : 465 - 482
12345