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 条
  • [1] Algorithms for the Set Covering Problem
    Alberto Caprara
    Paolo Toth
    Matteo Fischetti
    Annals of Operations Research, 2000, 98 : 353 - 371
  • [2] Algorithms for the set covering problem
    Caprara, A
    Toth, P
    Fischetti, M
    ANNALS OF OPERATIONS RESEARCH, 2000, 98 (1-4) : 353 - 371
  • [3] Binary Bat Algorithms for the Set Covering Problem
    Crawford, Broderick
    Soto, Ricardo
    Olea, Claudia
    Johnson, Franklin
    Paredes, Fernando
    2015 10TH IBERIAN CONFERENCE ON INFORMATION SYSTEMS AND TECHNOLOGIES (CISTI), 2015,
  • [4] EXPERIMENTAL COMPARISON OF ALGORITHMS FOR THE SET COVERING PROBLEM AND THE OPTIMIZATION PROBLEM OF A PSEUDO-BOOLEAN FUNCTION
    BILLIONNET, A
    CARADOT, I
    RAIRO-RECHERCHE OPERATIONNELLE-OPERATIONS RESEARCH, 1983, 17 (01): : 15 - 20
  • [5] EFFICIENT HEURISTIC ALGORITHMS FOR THE WEIGHTED SET COVERING PROBLEM
    BAKER, EK
    COMPUTERS & OPERATIONS RESEARCH, 1981, 8 (04) : 303 - 310
  • [6] Computational experience with approximation algorithms for the set covering problem
    Grossman, T
    Wool, A
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1997, 101 (01) : 81 - 92
  • [7] LINEAR ALGORITHMS FOR THE SET PARTITIONING PROBLEM, THE SET COVERING PROBLEM AND THE BIN PACKING PROBLEM IN THE HYPERGRAPH OF INTERVALS
    GONDRAN, M
    RAIRO-RECHERCHE OPERATIONNELLE-OPERATIONS RESEARCH, 1979, 13 (01): : 13 - 21
  • [8] Ant-Line: A Line-Oriented ACO Algorithm for the Set Covering Problem
    Mulati, Mauro Henrique
    Constantino, Ademir Aparecido
    2011 30TH INTERNATIONAL CONFERENCE OF THE CHILEAN COMPUTER SCIENCE SOCIETY (SCCC), 2012, : 265 - 274
  • [9] The Impact of a New Formulation When Solving the Set Covering Problem Using the ACO Metaheuristic
    Crawford, Broderick
    Soto, Ricardo
    Palma, Wenceslao
    Paredes, Fernando
    Johnson, Franklin
    Norero, Enrique
    MODELLING, COMPUTATION AND OPTIMIZATION IN INFORMATION SYSTEMS AND MANAGEMENT SCIENCES - MCO 2015 - PT II, 2015, 360 : 209 - 218
  • [10] Evolutionary algorithms for multiple allocation hub set covering problem
    Weng, Kerui
    Wang, Yijuan
    PROCEEDINGS OF 2008 IEEE INTERNATIONAL CONFERENCE ON NETWORKING, SENSING AND CONTROL, VOLS 1 AND 2, 2008, : 408 - +
12345