Abstract
Transfer synchronization is an important issue in timetable scheduling for an urban rail transit system, especially a cross-platform transfer. In this paper, we aim to optimize the performance of transfer throughout the daily operation of an urban rail transit system. The daily operation is divided into multiple time periods and each time period has a specific headway to fulfill time varied passenger demand. At the same time, the turn-back process of trains should also be considered for a real operation. Therefore, our work enhances the base of the transfer synchronization model taking into account time-dependent passenger demand and utilization of trains. A mixed integer programming model is developed to obtain an optimal timetable, providing a smooth transfer for cross-transfer platform and minimizing the transfer waiting time for all transfer passengers from different directions with consideration of timetable symmetry. By adjusting the departure time of trains based on a predetermined timetable, this transfer optimization model is solved through a genetic algorithm. The proposed model and algorithm are utilized for a real transfer problem in Beijing and the results demonstrate a significant reduction in transfer waiting time.
Highlights
Within the development and expansion of a rail transit network, passengers always have to transfer between different lines to reach their final destinations
To solve the practical problem in timetable scheduling, in this paper, a mixed integer linear programming model (MIP) which considers the usage of trains is established for transfer synchronization with the study horizon as a whole day
The paper is structured as follows: In Section 2, we describe the transfer synchronization model and assumptions; in Section 3, a heuristic algorithm is developed to obtain an optimal solution; in Section 4, a case study based on transfer synchronization between two lines in Beijing is conducted to demonstrate the effectiveness of the model and algorithm; in Section 5, we present the main conclusions and recommend future research
Summary
Within the development and expansion of a rail transit network, passengers always have to transfer between different lines to reach their final destinations It is a negative feeling for transfer passengers to wait a long time for connecting trains [1]. Timetable designers pay more attention to transfer coordination since a missed connection can lead to a long transfer waiting time During this time period, many transfer optimization models are developed that aim to minimize transfer waiting time, with the assumption that there is sufficient train capacity for passengers [6,7,8]. To solve the practical problem in timetable scheduling, in this paper, a mixed integer linear programming model (MIP) which considers the usage of trains is established for transfer synchronization with the study horizon as a whole day. The paper is structured as follows: In Section 2, we describe the transfer synchronization model and assumptions; in Section 3, a heuristic algorithm is developed to obtain an optimal solution; in Section 4, a case study based on transfer synchronization between two lines in Beijing is conducted to demonstrate the effectiveness of the model and algorithm; in Section 5, we present the main conclusions and recommend future research
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
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
