An iterative heuristic for strategic timetabling with integrated passenger routing in railway networks
Yahan Lu (TU Delft - Transport, Mobility and Logistics)
Rob M.P. Goverde (TU Delft - Transport, Mobility and Logistics)
Gabor Maroti (Nederlandse Spoorwegen, Vrije Universiteit Amsterdam)
Dennis Huisman ( Erasmus Universiteit Rotterdam, Nederlandse Spoorwegen)
More Info
expand_more
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
Periodic timetabling is a crucial but computationally challenging problem in the railway planning field. Existing approaches often overlook the interaction between passenger routes and timetables, leading to suboptimal solutions. In this paper, we propose a method that incorporates passenger routing into the optimization of periodic timetables. Our goal is to optimize the periodic timetable from the strategic planning perspective, aiming to minimize the total perceived passenger travel time. We propose an iterative heuristic approach that integrates an adaptive large neighborhood search algorithm with a mixed-integer linear programming solver. To improve the efficiency of the algorithm, we design tailored operators and an outer loop. We conduct realworld case studies on real-life instances of Netherlands Railways to illustrate the effectiveness of our approach. The computational results show that our solution method is capable of addressing real-life problems.