Abstract

Last-train timetables are significant in metro systems and directly influence transportation organization efficiency and passenger service levels. This study focuses on the collaborative optimization of last-train timetables for a large-scale metro network. Different from most studies, which often focus on improving the ability of passengers to transfer between different metro lines (transfer accessibility) during the last-train period, or the ability of passengers to reach their destinations after boarding the last train service from the origin station (origin-destination (OD) accessibility), this work aims to optimize the latest time for passengers (LTP) to reach their destinations using the metro services. A mixed-integer linear programming (MILP) model is established to optimize the last-train timetables with maximizing LTPs. For comparison, two MILP models respectively aim at maximizing transfer accessibilities and OD accessibilities, are adopted as benchmarks. An improved genetic algorithm based on Q-learning (QGA) is developed to solve the proposed MILP models for optimizing last-train timetables for a large-scale metro network. The proposed method is validated by optimizing the last-train timetable of the metro network of Chengdu, China. The results indicate that compared with optimizing the transfer and OD accessibilities, optimizing LTPs can consider both single-line and multiple-line passenger benefits, and directly increase their accessibilities and feasible times to use the metro service.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.