Optimal coordination of last trains for maximum transfer accessibility with heterogeneous walking time

Abstract

Last train coordination aims to synchronize the arrival and departure times of the last feeder trains and the last connecting trains at transfer stations to improve the transfer accessibility of urban rail networks. This study focuses on the transfer accessibility between last trains with considering heterogeneous transfer walking time. Three mathematical models are developed on the last train timetable optimization. The first model fine-tunes the last train timetable under the given bound of the dwell time. The second one aims to allow the mutual transfers with the prolonged dwell time to maximize the transfer accessibility. A biobjective function is proposed to seek the trade-off between the maximal transfer accessibility and the minimal extension of dwell time. The third model considers the heterogeneity of transfer walking time that is represented as a random variable following a probability distribution. A discrete approximation method is proposed to reformulate the nonlinear model. The embedded Branch & Cut algorithm of CPLEX is applied to solve the models. A real case on the Shenzhen metro network is conducted to demonstrate the performance of the models. The three models all provide better last train timetable than the current timetable in practice. The sensitivity analysis manifests that the third model are always advantageous in the optimization of successful transfer passengers. © 2019 Yao Chen et al.