Scheduling multimodal alternative services for managing infrastructure maintenance possessions in railway networks

Journal Article (2021)
Author(s)

Jacob Trepat Borecka (Student TU Delft)

N Bešinović (TU Delft - Transport and Planning)

Transport and Planning
Copyright
© 2021 Jacob Trepat Borecka, Nikola Bešinović
DOI related publication
https://doi.org/10.1016/j.trb.2021.10.009
More Info
expand_more
Publication Year
2021
Language
English
Copyright
© 2021 Jacob Trepat Borecka, Nikola Bešinović
Transport and Planning
Volume number
154
Pages (from-to)
147-174
Reuse Rights

Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.

Abstract

Highly utilized railway networks require regular infrastructure maintenance. Different track sections often need to be closed for entire days to carry out engineering works, which makes the regular timetables no longer feasible and thus adjusted railway services and temporary alternative services need to be planned. We introduce the Multimodal Alternative Services for Possessions (MASP) problem to support the planning of alternative services, from the passenger and transport operator points of view, including an adjusted train timetable, bus-bridging services and extra train services. The MASP problem is formulated based on the Service Network Design Problem and the Vehicle Routing Problem. To solve it efficiently, we develop a solution framework that incorporates heuristics based on the column and row generation with mixed-integer linear programming. The developed framework provides the optimized alternative service routes, schedules and passenger flows routing. We demonstrated the performance of the MASP solution framework on the real-life Dutch railway network. The results show that the MASP framework is capable of efficiently generating alternative services to route passenger flows affected by possessions with a very limited increase in the total passenger costs compared to a scenario with no link closures. High computational efficiency is observed even for highly disrupted networks.