Abstract
There usually exists a high density of traffic through bottleneck sections of mainline railways, where a perturbation of one single train could result in long consequential delays across a number of trains. In the event of disturbances, rescheduling trains approaching the bottleneck will be necessary to increase the throughput of the section. To model the real-time train rescheduling problems around bottleneck sections, a mixed-integer programming model is presented in this paper. An innovative improved algorithm (DE_JRM) is developed to solve the problem. The model and the algorithms are validated with a case study using Monte Carlo methodology, which demonstrates that the proposed algorithm can reduce the weighted average delay and satisfy the requirements of real-time traffic control applications.
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 callMore From: IEEE Transactions on Intelligent Transportation Systems
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.
