A Branch-and-Price algorithm for railway rolling stock rescheduling
Authors:
- Richard M. LusbyRLRichard M. Lusby
- Jørgen Thorlund HaahrJHJørgen Thorlund Haahr
- Jesper LarsenJLJesper Larsen
- David PisingerDPDavid Pisinger
- 1 May 2017
- journal article
- Published by Elsevier in Transportation Research Part B: Methodological
- Vol. 99, 228-250
Abstract
No abstract availableThis publication has 25 references indexed in Scilit:
- An overview of recovery models and algorithms for real-time railway reschedulingTransportation Research Part B: Methodological, 2014
- Railway Rolling Stock Planning: Robustness Against Large DisruptionsTransportation Science, 2012
- Robust rolling stock in rapid transit networksComputers & Operations Research, 2011
- Solving a real-world train-unit assignment problemMathematical Programming, 2010
- Rescheduling in passenger railways: the rolling stock rebalancing problemJournal of Scheduling, 2009
- Efficient Circulation of Railway Rolling StockTransportation Science, 2006
- Branching rules revisitedOperations Research Letters, 2005
- Allocation of Railway Rolling Stock for Passenger TrainsTransportation Science, 2004
- Branch-and-Price: Column Generation for Solving Huge Integer ProgramsOperations Research, 1998
- Schedule Optimization at SNCF: From Conception to Day of DepartureInterfaces, 1998