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 条
12345