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.
Modeling and Solving Real-Time Train Rescheduling Problems in Railway Bottleneck Sections
IEEE Transactions on Intelligent Transportation Systems ; 16 , 4 ; 1896-1904
2015-08-01
1028123 byte
Article (Journal)
Electronic Resource
English
Modeling and Solving Real-Time Train Rescheduling Problems in Railway Bottleneck Sections
Online Contents | 2015
|British Library Conference Proceedings | 2010
|Real-time rescheduling method and device for solving train operation delay
European Patent Office | 2023
|Real-time train rescheduling in junction areas
British Library Online Contents | 2010
|Real-Time Train Rescheduling in Junction Areas
SAGE Publications | 2010
|