Algorithms for the Set Covering Problem

被引：14
|
作者：
Alberto Caprara
Paolo Toth
Matteo Fischetti
机构：
[1] University of Bologna,DEIS
[2] University of Padova,DEI
来源：
Annals of Operations Research | 2000年 / 98卷
关键词：
Important Application; Experimental Comparison; Covering Problem; Main Model; Effective Algorithm;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
The Set Covering Problem (SCP) is a main model for several important applications, including crew scheduling in railway and mass-transit companies. In this survey, we focus our attention on the most recent and effective algorithms for SCP, considering both heuristic and exact approaches, outlining their main characteristics and presenting an experimental comparison on the test-bed instances of Beasley's OR Library.
引用
收藏
页码：353 / 371
页数：18
相关论文
共 50 条
  • [1] Algorithms for the set covering problem
    Caprara, A
    Toth, P
    Fischetti, M
    [J]. ANNALS OF OPERATIONS RESEARCH, 2000, 98 (1-4) : 353 - 371
  • [2] Binary Bat Algorithms for the Set Covering Problem
    Crawford, Broderick
    Soto, Ricardo
    Olea, Claudia
    Johnson, Franklin
    Paredes, Fernando
    [J]. 2015 10TH IBERIAN CONFERENCE ON INFORMATION SYSTEMS AND TECHNOLOGIES (CISTI), 2015,
  • [3] A comparison between ACO algorithms for the set covering problem
    Lessing, L
    Dumitrescu, I
    Stützle, T
    [J]. ANT COLONY OPTIMIZATION AND SWARM INTELLIGENCE, PROCEEDINGS, 2004, 3172 : 1 - 12
  • [4] EFFICIENT HEURISTIC ALGORITHMS FOR THE WEIGHTED SET COVERING PROBLEM
    BAKER, EK
    [J]. COMPUTERS & OPERATIONS RESEARCH, 1981, 8 (04) : 303 - 310
  • [5] Computational experience with approximation algorithms for the set covering problem
    Grossman, T
    Wool, A
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1997, 101 (01) : 81 - 92
  • [6] LINEAR ALGORITHMS FOR THE SET PARTITIONING PROBLEM, THE SET COVERING PROBLEM AND THE BIN PACKING PROBLEM IN THE HYPERGRAPH OF INTERVALS
    GONDRAN, M
    [J]. RAIRO-RECHERCHE OPERATIONNELLE-OPERATIONS RESEARCH, 1979, 13 (01): : 13 - 21
  • [7] Evolutionary algorithms for multiple allocation hub set covering problem
    Weng, Kerui
    Wang, Yijuan
    [J]. PROCEEDINGS OF 2008 IEEE INTERNATIONAL CONFERENCE ON NETWORKING, SENSING AND CONTROL, VOLS 1 AND 2, 2008, : 408 - +
  • [8] An empirical study of hybrid genetic algorithms for the set covering problem
    Vasko, FJ
    Knolle, PJ
    Spiegel, DS
    [J]. JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2005, 56 (10) : 1213 - 1223
  • [9] Binary Fruit Fly Swarm Algorithms for the Set Covering Problem
    Crawford, Broderick
    Soto, Ricardo
    Mella, Hanns de la Fuente
    Elortegui, Claudio
    Palma, Wenceslao
    Torres-Rojas, Claudio
    Vasconcellos-Gaete, Claudia
    Becerra, Marcelo
    Pena, Javier
    Misra, Sanjay
    [J]. CMC-COMPUTERS MATERIALS & CONTINUA, 2022, 71 (03): : 4295 - 4318
  • [10] EXPERIMENTS WITH PARALLEL BRANCH-AND-BOUND ALGORITHMS FOR THE SET COVERING PROBLEM
    RUSHMEIER, RA
    NEMHAUSER, GL
    [J]. OPERATIONS RESEARCH LETTERS, 1993, 13 (05) : 277 - 285
12345