A Mixed-Integer Linear Program for Routing and Scheduling Trains through a Railway Station

Lijie Bai, Thomas Bourdeaud'huy, Besoa Rabenasolo, Emmanuel Castelain

2014

Abstract

This paper studies a train routing and scheduling problem faced by railway station infrastructure managers to generate a conflict-free timetable which consists of two parts, commercial movements and technical movements. Firstly, we present the problem and propose a discrete-time mixed-integer linear mathematical model formulation. Due to the computational complexity of integer programming methods, we need to improve the calculation performance. On one hand, we consider the problem in continuous-time domain which decrease the computational size. The integrality of the scheduling variables is proved. On the other hand, the redundant constraints are cut off by probing the potential conflicts between trains and movements. The full practical problem is large: 247 trains consisting of 503 movements per day should be considered. The proposed approach can solve an instance made of 60 trains and 121 movements representing 385 minutes of traffic within less than 2 minutes.

References

  1. Bai, L., Bourdeaud'huy, T., Castelain, E., and Rabenasolo, B. (2013). Recherche de plans d'occupation de voies dans les réseaux ferroviaires. In 14e conférence ROADEF de la société Franc¸aise de Recherche Opérationnelle et Aide à la Décision.
  2. Benders, J. (1962). Partitioning procedures for solving mixed-variables programming problems. In Numerische Mathematik, 4: 238-252.
  3. Binato, S., Pereira, M., and Granville, S. (2001). A new benders decomposition approach to solve power transmission network design problems. In Numerische Mathematik, 16(2): 235-240.
  4. Caimi, G. (2009). Algorithmic decision support for train scheduling in a large railway network. In PhD thesis. ETH Zurich.
  5. Carey, M. (1994a). Extending a train pathing model from one-way to two-way track. In Transportation Research B 28 (5): 395-400.
  6. Carey, M. (1994b). A model and strategy for train pathing with choice of lines, platforms and routes. In Transportation Research B 28 (5): 333-353.
  7. Carey, M. and Carville, S. (2003). Scheduling and platforming trains at busy complex stations. In Transportation Research A 37 (3): 195-224.
  8. Cordeau, J., Soumis, F., and Desrosiers, J. (1975). A benders decomposition approach for the locomotive and car assignment problem. In Transportation Science, 34(2): 133-149.
  9. D'Ariano, A. (2008). Improving real-time train dispatching: model, algorithms and applications. In PhD thesis. TU Delft.
  10. D'Ariano, A., Pacciarelli, D., and Pranzo, M. (2007). A branch and bound algorithm for scheduling trains in railway network. In European Journal of Operational Research 183: 643-657.
  11. Floudas, C. and Lin, X. (2004). Continuous-time versus discrete-time approaches for scheduling of chemical processes: A review. In Computers and Chemical Engineering 28: 2109-2129.
  12. Heller, I. and Tompkins, C. (1956). An extension of a theorem of Dantzig's. In Linear inequalities and related systems: 247-254. Princeton Univ. Press, Princeton, NJ.
  13. Hoffman, A. and Kruskal, J. (1956). Integral boundary points of convex polyhedra. In Linear inequalities and related systems: 223-246. Princeton Univ. Press, Princeton, NJ.
  14. Kroon, L., Romeijn, H., and Zwaneveld, P. (1997). Routing trains through railway stations: Complexity issues. In European Journal of Operational Research 98: 485- 498.
  15. Kroon, L. and Zwaneveld, P. (1995). Stations: Final report of phase 1, ERASMUS management report series no.201. In Rotterdam School of Manangement. Erasmus University Rotterdam. Rotterdam. Netherlands.
  16. Schrijver, A. and Steenbeek, A. (1994). Dienstregeling ontwikkeling voor Railned (timetable development for railway station). In Report Cadans 1.0. C.W.I. Amsterdam, Netherlands.
  17. Serafini, P. and Ukovich., W. (1989). Mathematical model for periodic scheduling problems. In SIAM Journal on Discrete Mathematics 2: 550-581.
  18. Watson., R. (2001). The effects of railway privatisation on train planning. In Transport Reviews 21(2): 181-193.
  19. Zwaneveld, P. (1997). Railway planning-routing of trains and allocation of passenger lines. In PhD thesis. Erasmus University Rotterdam. Rotterdam. Netherlands.
  20. Zwaneveld, P., Kroon, L., and Ambergen, H. (1996). A decision support system for routing trains through railway stations. In Proceedings of Comp Rail 96:217-226. Computational Mechanics Publications, Southampton, Berlin.
  21. Zwaneveld, P., Kroon, L., and van Hoesel, S. (2001). Routing trains through a railway station based on a node packing model. In European Journal of Operational Research 128: 14-33.
Download


Paper Citation


in Harvard Style

Bai L., Bourdeaud'huy T., Rabenasolo B. and Castelain E. (2014). A Mixed-Integer Linear Program for Routing and Scheduling Trains through a Railway Station . In Proceedings of the 3rd International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES, ISBN 978-989-758-017-8, pages 445-452. DOI: 10.5220/0004863104450452


in Bibtex Style

@conference{icores14,
author={Lijie Bai and Thomas Bourdeaud'huy and Besoa Rabenasolo and Emmanuel Castelain},
title={A Mixed-Integer Linear Program for Routing and Scheduling Trains through a Railway Station},
booktitle={Proceedings of the 3rd International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES,},
year={2014},
pages={445-452},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0004863104450452},
isbn={978-989-758-017-8},
}


in EndNote Style

TY - CONF
JO - Proceedings of the 3rd International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES,
TI - A Mixed-Integer Linear Program for Routing and Scheduling Trains through a Railway Station
SN - 978-989-758-017-8
AU - Bai L.
AU - Bourdeaud'huy T.
AU - Rabenasolo B.
AU - Castelain E.
PY - 2014
SP - 445
EP - 452
DO - 10.5220/0004863104450452