Abstract
As the subway system is beginning to operate interval trains in the early morning, it is necessary to discuss the first train timetable synchronization with interval trains. In this paper, with the consideration of both ordinary trains and interval trains, we study the first train timetable problem with minimum total transfer waiting time. The first train timetable model is formulated as a mixed integer programming problem and a genetic simulated annealing algorithm is developed to deal with the case study of Beijing subway network. The proposed model and the algorithm are effective in improving the performance of the first train timetable synchronization. After optimization, the total transfer waiting time and the number of long waiting time transfer directions for Beijing subway network have decreased significantly. The results indicate that operating interval trains is an effective way to solve the problem of long waiting time in early morning.
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 callDisclaimer: 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.
