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 条

[41] A DATA SCALABLE AUGMENTED LAGRANGIAN KKT PRECONDITIONER FOR LARGE-SCALE INVERSE PROBLEMS
Alger, Nick
Villa, Umberto
Tan Bui-Thanh
Ghattas, Omar
SIAM JOURNAL ON SCIENTIFIC COMPUTING, 2017, 39 (05): : A2365 - A2393
[42] Discrete Lagrangian-based search for solving MAX-SAT problems
Wah, BW
Shang, Y
IJCAI-97 - PROCEEDINGS OF THE FIFTEENTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, VOLS 1 AND 2, 1997, : 378 - 383
[43] An evolutionary algorithm for large scale set covering problems with application to airline crew scheduling
Marchiori, E
Steenbeek, A
REAL-WORLD APPLICATIONS OF EVOLUTIONARY COMPUTING, PROCEEDINGS, 2000, 1803 : 367 - 381
[44] A novel model for transfer synchronization in transit networks and a Lagrangian-based heuristic solution method
Ansarilari, Zahra
Bodur, Merve
Shalaby, Amer
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2024, 317 (01) : 76 - 91
[45] Modified Shifting Bottleneck Heuristic for Scheduling Problems of Large-Scale Job Shops
周炳海
彭涛
JournalofDonghuaUniversity(EnglishEdition), 2016, 33 (06) : 883 - 887
[46] Heuristic Strategies for Solving Complex Interacting Large-Scale Stockpile Blending Problems
Xie, Yue
Neumann, Aneta
Neumann, Frank
2021 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC 2021), 2021, : 1288 - 1295
[47] A Fast and Scalable Heuristic for the Solution of Large-Scale Capacitated Vehicle Routing Problems
Accorsi, Luca
Vigo, Daniele
TRANSPORTATION SCIENCE, 2021, 55 (04) : 832 - 856
[48] An integrated search heuristic for large-scale flexible job shop scheduling problems
Yuan, Yuan
Xu, Hua
COMPUTERS & OPERATIONS RESEARCH, 2013, 40 (12) : 2864 - 2877
[49] HEURISTIC METHODS FOR SOLVING LARGE-SCALE NETWORK ROUTING PROBLEMS - TELPAKING PROBLEM
CLAUS, A
KLEITMAN, DJ
STUDIES IN APPLIED MATHEMATICS, 1975, 54 (01) : 17 - 29
[50] Heuristic and optimal solutions for set-covering problems in conservation biology
Moore, JL
Folkmann, M
Balmford, A
Brooks, T
Burgess, N
Rahbek, C
Williams, PH
Krarup, J
ECOGRAPHY, 2003, 26 (05) : 595 - 601

← 1 2 3 4 5 →