A three-step Benders decomposition for the real-time Railway Traffic Management Problem
Authors:
- Kaba KeitaKKKaba Keita
- Paola PellegriniPPPaola Pellegrini
- Joaquin RodriguezJRJoaquin Rodriguez
- 1 May 2020
- journal article
- review article
- Published by Elsevier in Journal of Rail Transport Planning & Management
- Vol. 13
Abstract
No abstract availableKeywords
Funding Information
- Ministère de l'Enseignement Supérieur et de la Recherche
- Conseil Régional Hauts-de-France
- European Commission
This publication has 21 references indexed in Scilit:
- Rescheduling models for railway traffic management in large-scale networksPublic Transport, 2013
- A model predictive control approach for discrete-time rescheduling in complex central railway station areasComputers & Operations Research, 2012
- Design of an effective algorithm for fast response to the re-scheduling of railway traffic during disturbancesTransportation Research Part C: Emerging Technologies, 2012
- Optimal inter-area coordination of train rescheduling decisionsTransportation Research Part E: Logistics and Transportation Review, 2012
- A MIP‐based local search method for the railway rescheduling problemNetworks, 2010
- A branch and bound algorithm for scheduling trains in a railway networkEuropean Journal of Operational Research, 2007
- A constraint programming model for real-time train scheduling at junctionsTransportation Research Part B: Methodological, 2007
- An exact solution procedure to determine the optimal dispatching times for complex rail networksIIE Transactions, 2006
- Railway traffic control and train scheduling based oninter-train conflict managementTransportation Research Part B: Methodological, 1999
- Partitioning procedures for solving mixed-variables programming problemsNumerische Mathematik, 1962