A Lagrangian-based heuristic for large-scale set covering problems

被引：101
|
作者：
Ceria, S [1 ]
Nobili, P
Sassano, A
机构：
[1] Columbia Univ, Grad Sch Business, New York, NY 10027 USA
[2] CNR, Ist Anal Sistemi & Informat, I-00185 Rome, Italy
[3] Univ La Sapienza, Dipartimento Informat & Sistemist, I-00185 Rome, Italy
来源：
MATHEMATICAL PROGRAMMING | 1998年 / 81卷 / 02期
关键词：
set covering; crew scheduling; primal-dual Lagrangian; subgradient algorithms; 0-1; programming; approximate solutions; railways;
D O I：
10.1007/BF01581106
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
We present a new Lagrangian-based heuristic for solving large-scale set-covering problems arising from crew-scheduling at the Italian Railways (Ferrovie dello Stato). Our heuristic obtained impressive results when compared to state-of-the-art codes on a test-bed provided by the company, which includes instances with sizes ranging from 50,000 variables and 500 constraints to 1,000,000 variables and 5000 constraints. (C) 1998 The Mathematical Programming Society, Inc. Published by Elsevier Science B.V.
引用
收藏
页码：215 / 228
页数：14
相关论文
共 50 条
  • [21] A multidimensional fitness function based heuristic algorithm for set covering problems
    Hashemi, Ahmad
    Gholami, Hamed
    Delorme, Xavier
    Wong, Kuan Yew
    APPLIED SOFT COMPUTING, 2025, 174
  • [22] On an augmented Lagrangian-based preconditioning of Oseen type problems
    He, Xin
    Neytcheva, Maya
    Capizzano, Stefano Serra
    BIT NUMERICAL MATHEMATICS, 2011, 51 (04) : 865 - 888
  • [23] Augmented Lagrangian method for large-scale linear programming problems
    Evtushenko, YG
    Golikov, AI
    Mollaverdy, N
    OPTIMIZATION METHODS & SOFTWARE, 2005, 20 (4-5): : 515 - 524
  • [24] A Lagrangian relaxation approach to large-scale flow interception problems
    Gzara, Fatma
    Erkut, Erhan
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2009, 198 (02) : 405 - 411
  • [25] A HEURISTIC ALGORITHM FOR THE MULTICRITERIA SET-COVERING PROBLEMS
    LIU, YH
    APPLIED MATHEMATICS LETTERS, 1993, 6 (05) : 21 - 23
  • [26] An effective heuristic for large-scale capacitated facility location problems
    Avella, Pasquale
    Boccia, Maurizio
    Sforza, Antonio
    Vasil'ev, Igor
    JOURNAL OF HEURISTICS, 2009, 15 (06) : 597 - 615
  • [27] An effective heuristic for large-scale capacitated facility location problems
    Pasquale Avella
    Maurizio Boccia
    Antonio Sforza
    Igor Vasil’ev
    Journal of Heuristics, 2009, 15 : 597 - 615
  • [28] A fast heuristic for large-scale capacitated arc routing problems
    Wohlk, Sanne
    Laporte, Gilbert
    JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2018, 69 (12) : 1877 - 1887
  • [29] On an augmented Lagrangian-based preconditioning of Oseen type problems
    Xin He
    Maya Neytcheva
    Stefano Serra Capizzano
    BIT Numerical Mathematics, 2011, 51 : 865 - 888
  • [30] A New Direct Coefficient-Based Heuristic Algorithm for Set Covering Problems
    Ahmad Hashemi
    Hamed Gholami
    Uday Venkatadri
    Sasan Sattarpanah Karganroudi
    Samer Khouri
    Adam Wojciechowski
    Dalia Streimikiene
    International Journal of Fuzzy Systems, 2022, 24 : 1131 - 1147
12345