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 条
  • [31] Large-scale test data set for location problems
    Cebecauer, Matej
    Buzna, Lubos
    DATA IN BRIEF, 2018, 17 : 267 - 274
  • [32] A set-covering-based heuristic approach for bin-packing problems
    Monaci, M
    Toth, P
    INFORMS JOURNAL ON COMPUTING, 2006, 18 (01) : 71 - 85
  • [33] Benders decomposition for very large scale partial set covering and maximal covering location problems
    Cordeau, Jean-Francois
    Furini, Fabio
    Ljubic, Ivana
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2019, 275 (03) : 882 - 896
  • [34] A New Direct Coefficient-Based Heuristic Algorithm for Set Covering Problems
    Hashemi, Ahmad
    Gholami, Hamed
    Venkatadri, Uday
    Karganroudi, Sasan Sattarpanah
    Khouri, Samer
    Wojciechowski, Adam
    Streimikiene, Dalia
    INTERNATIONAL JOURNAL OF FUZZY SYSTEMS, 2022, 24 (02) : 1131 - 1147
  • [35] Improving a heuristic repair method for large-scale school timetabling problems
    Kaneko, K
    Yoshikawa, M
    Nakakuki, Y
    PRINCIPLES AND PRACTICE OF CONSTRAINT PROGRAMMING-CP'99, 1999, 1713 : 275 - 288
  • [36] A heuristic method for large-scale multi-facility location problems
    Levin, Y
    Ben-Israel, A
    COMPUTERS & OPERATIONS RESEARCH, 2004, 31 (02) : 257 - 272
  • [37] Effective heuristic for large-scale unrelated parallel machines scheduling problems
    Wang, Haibo
    Alidaee, Bahram
    OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE, 2019, 83 : 261 - 274
  • [38] A Lagrangian-based heuristic for the capacitated lot-sizing problem in parallel machines
    Toledo, Franklina Maria Bragion
    Armentano, Vinicius Amaral
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2006, 175 (02) : 1070 - 1083
  • [39] Gravity-based heuristic for set covering problems and its application in fault diagnosis
    Li, Yun
    Cai, Zhiming
    JOURNAL OF SYSTEMS ENGINEERING AND ELECTRONICS, 2012, 23 (03) : 391 - 398
  • [40] Gravity-based heuristic for set covering problems and its application in fault diagnosis
    Yun Li1
    2.Troops 54645 of the PLA
    JournalofSystemsEngineeringandElectronics, 2012, 23 (03) : 391 - 398
12345