Railway Rolling Stock Planning: Robustness Against Large Disruptions
Valentina Cacchiani (),
Alberto Caprara (),
Laura Galli (),
Leo Kroon (),
Gábor Maróti () and
Paolo Toth ()
Additional contact information
Valentina Cacchiani: Department of Electronics, Computer Science, and Systems, University of Bologna, 40136 Bologna, Italy
Alberto Caprara: Department of Electronics, Computer Science, and Systems, University of Bologna, 40136 Bologna, Italy
Laura Galli: Department of Electronics, Computer Science, and Systems, University of Bologna, 40136 Bologna, Italy
Leo Kroon: Rotterdam School of Management, Erasmus University Rotterdam, NL-3000 DR Rotterdam, The Netherlands; and Netherlands Railways, NL-3500 HA Utrecht, The Netherlands
Gábor Maróti: Rotterdam School of Management, Erasmus University Rotterdam, NL-3000 DR Rotterdam, The Netherlands
Paolo Toth: Department of Electronics, Computer Science, and Systems, University of Bologna, 40136 Bologna, Italy
Transportation Science, 2012, vol. 46, issue 2, 217-232
Abstract:
In this paper we describe a two-stage optimization model for determining robust rolling stock circulations for passenger trains. Here robustness means that the rolling stock circulations can better deal with large disruptions of the railway system. The two-stage optimization model is formulated as a large mixed-integer linear programming (MILP) model. We first use Benders decomposition to determine optimal solutions for the LP-relaxation of this model. Then we use the cuts that were generated by the Benders decomposition for computing heuristic robust solutions for the two-stage optimization model. We call our method Benders heuristic . We evaluate our approach on the real-life rolling stock-planning problem of Netherlands Railways, the main operator of passenger trains in the Netherlands. The computational results show that, thanks to Benders decomposition, the LP-relaxation of the two-stage optimization problem can be solved in a short time for a representative number of disruption scenarios. In addition, they demonstrate that the robust rolling stock circulation computed heuristically has total costs that are close to the LP lower bounds. Finally, we discuss the practical effectiveness of the robust rolling stock circulation: When a large number of disruption scenarios were applied to these robust circulations and to the nonrobust optimal circulations, the former appeared to be much more easily recoverable than the latter.
Keywords: two-stage optimization; rolling stock planning; integer linear programming (search for similar items in EconPapers)
Date: 2012
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (29)
Downloads: (external link)
http://dx.doi.org/10.1287/trsc.1110.0388 (application/pdf)
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:inm:ortrsc:v:46:y:2012:i:2:p:217-232
Access Statistics for this article
More articles in Transportation Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().