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 条
  • [31] Relaxation heuristics for the set covering problem
    Umetani, Shunji
    Yagiura, Mutsunori
    JOURNAL OF THE OPERATIONS RESEARCH SOCIETY OF JAPAN, 2007, 50 (04) : 350 - 375
  • [32] Approximation of a geometric set covering problem
    Kovaleva, S
    Spieksma, FCR
    ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2001, 2223 : 493 - 501
  • [33] A hybrid heuristic for the set covering problem
    Shyam Sundar
    Alok Singh
    Operational Research, 2012, 12 : 345 - 365
  • [34] ON THE FRACTIONAL SOLUTION TO THE SET COVERING PROBLEM
    HOCHBAUM, DS
    SIAM JOURNAL ON ALGEBRAIC AND DISCRETE METHODS, 1983, 4 (02): : 221 - 222
  • [35] A rough set method for the unicost set covering problem
    Xu, Qingyuan
    Tan, Anhui
    Lin, Yaojin
    INTERNATIONAL JOURNAL OF MACHINE LEARNING AND CYBERNETICS, 2017, 8 (03) : 781 - 792
  • [36] A generalization of the weighted set covering problem
    Yang, J
    Leung, JYT
    NAVAL RESEARCH LOGISTICS, 2005, 52 (02) : 142 - 149
  • [37] Ant system for the set covering problem
    Silva, RMD
    Ramalho, GL
    2001 IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN, AND CYBERNETICS, VOLS 1-5: E-SYSTEMS AND E-MAN FOR CYBERNETICS IN CYBERSPACE, 2002, : 3129 - 3133
  • [38] A genetic algorithm for the set covering problem
    AlSultan, KS
    Hussain, MF
    Nizami, JS
    JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 1996, 47 (05) : 702 - 709
  • [39] A hybrid heuristic for the set covering problem
    Sundar, Shyam
    Singh, Alok
    OPERATIONAL RESEARCH, 2012, 12 (03) : 345 - 365
  • [40] Set covering problem with conflict constraints
    Saffari, Saeed
    Fathi, Yahya
    COMPUTERS & OPERATIONS RESEARCH, 2022, 143
12345