Path-oriented synchronized transit scheduling using time-dependent data

• Main Authors: Lee, Kelvin, Jiang, Yu, Ceder, Avishai, Dauwels, Justin, Su, Rong, Nielsen, Otto Anker
• Other Authors: Interdisciplinary Graduate School (IGS)
• Format: Article
• Language: English
• Published: 2022
• Subjects: Engineering::Civil engineering::Transportation; Public Transport; Schedule Synchronisation; Time-Dependent Data; Valid Inequality
• Online Access: https://hdl.handle.net/10356/161669
• Institution: Nanyang Technological University

With the emergence of innovations associated with public transport (PT) services, such as Mobility-as-a-Service, demand responsive transit, and autonomous vehicles, the door-to-door PT journey is achievable via multiple transfers between and within different PT travel modes. As such, seamless transfers between different modes of public transportation become an increasingly important factor for the attractiveness of PT services. At the same time, recent developments in travel time prediction methodologies offer new, reliable data sources for the optimization of PT operations. This work, with the consideration of these two elements, develops a mixed integer linear programming model for the PT schedule synchronization problem. The novelty is threefold. First, a novel concept of path-oriented scheduling is proposed. The path transfer time is explicitly formulated and minimized for providing a seamless travel experience considering that the emerging multimodal mobility inevitably induces multiple transfers. Time-dependent travel time data is also utilized in the model, which allows us to harness new and more representative data sources for improving PT services. In order to complement the increase in computational complexity as a result of the utilization of timedependent travel time data, four novel valid inequalities (VIs) are derived. Numerical studies show that the use of time-dependent travel time data is beneficial in terms of reducing path transfer times when compared to using the mean historical travel times and there exists a tradeoff between the maximum allowable path transfer time and the trip time. Meanwhile, simulation studies using Copenhagen network demonstrate that using valid inequalities could significantly reduce the computation time around 20% on average, where the maximum reduction in computation time could exceed 86%. In addition, the proposed valid inequalities are benchmarked against two classes of valid inequalities in the literature. It is found that the proposed valid inequalities could outperform them and combining different valid inequalities could further improve computational performance.