Behavior of the ant colony algorithm for the set covering problem

被引：0
|
作者：
Alexandrov, D [1 ]
Kochetov, Y [1 ]
机构：
[1] Sobolev Inst Math, Novosibirsk 630090, Russia
来源：
OPERATIONS RESEARCH PROCEEDINGS 1999 | 2000年
关键词：
D O I：
暂无
中图分类号：
C93 [管理学]; O22 [运筹学];
学科分类号：
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要：
We develop the Ant Colony approach for the classical Set Covering problem. As artificial ants we use three randomized greedy heuristics: GRASP heuristic and two asymptotically exact heuristics Random Neighborhood and Random Covering Set. We study the influence of the main control parameters and present new ideas for accumulating and exploiting of statistical information. Computational results for difficult benchmarks are discussed.
引用
收藏
页码：255 / 260
页数：6
相关论文
共 50 条
  • [1] Ant-Set: A Subset-Oriented Ant Colony Optimization Algorithm for the Set Covering Problem
    Lemos Schmitt, Murilo Falleiros
    Mulati, Mauro Henrique
    Constantino, Ademir Aparecido
    Hernandes, Fabio
    Hild, Tony Alexander
    [J]. JOURNAL OF UNIVERSAL COMPUTER SCIENCE, 2020, 26 (02) : 293 - 316
  • [2] An ant colony algorithm for solving set-covering problems
    Gao, Yang
    Ge, Hongwei
    [J]. DCABES 2006 PROCEEDINGS, VOLS 1 AND 2, 2006, : 467 - 469
  • [3] An Artificial Bee Colony Algorithm for the Set Covering Problem
    Cuesta, Rodrigo
    Crawford, Broderick
    Soto, Ricardo
    Paredes, Fernando
    [J]. MODERN TRENDS AND TECHNIQUES IN COMPUTER SCIENCE (CSOC 2014), 2014, 285 : 53 - 63
  • [4] A Fast and Efficient Ant Colony Optimization Approach for the Set Covering Problem
    Ren, Zhigang
    Feng, Zuren
    Ke, Liangjun
    Chang, Hong
    [J]. 2008 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION, VOLS 1-8, 2008, : 1839 - 1844
  • [5] New ideas for applying ant colony optimization to the set covering problem
    Ren, Zhi-Gang
    Feng, Zu-Ren
    Ke, Liang-Jun
    Zhang, Zhao-Jun
    [J]. COMPUTERS & INDUSTRIAL ENGINEERING, 2010, 58 (04) : 774 - 784
  • [6] An ant colony optimisation algorithm for the set packing problem
    Gandibleux, X
    Delorme, X
    T'Kindt, V
    [J]. ANT COLONY OPTIMIZATION AND SWARM INTELLIGENCE, PROCEEDINGS, 2004, 3172 : 49 - 60
  • [7] An Argentine ant system algorithm for partial set covering problem
    Liu, Xiaofan
    Zhou, Yupeng
    Yin, Minghao
    Lv, Shuai
    [J]. DATA TECHNOLOGIES AND APPLICATIONS, 2022, 56 (05) : 762 - 781
  • [8] An Ant Colony based Hyper-Heuristic Approach for the Set Covering Problem
    Ferreira, Alexandre Silvestre
    Pozo, Aurora Trinidad R.
    Goncalves, Richard Aderbal
    [J]. ADCAIJ-ADVANCES IN DISTRIBUTED COMPUTING AND ARTIFICIAL INTELLIGENCE JOURNAL, 2015, 4 (01): : 1 - 21
  • [9] Ant system for the set covering problem
    Silva, RMD
    Ramalho, GL
    [J]. 2001 IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN, AND CYBERNETICS, VOLS 1-5: E-SYSTEMS AND E-MAN FOR CYBERNETICS IN CYBERSPACE, 2002, : 3129 - 3133
  • [10] Set Covering on the Basis of the ant Algorithm
    Lebedev, B. K.
    Lebedev, O. B.
    Lebedeva, E. M.
    [J]. 2014 IEEE EAST-WEST DESIGN & TEST SYMPOSIUM (EWDTS), 2014,
12345