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.
Original language | English |
---|---|
Pages (from-to) | 1896-1904 |
Number of pages | 9 |
Journal | IEEE Transactions on Intelligent Transportation Systems |
Volume | 16 |
Issue number | 4 |
Early online date | 8 Jan 2015 |
DOIs | |
Publication status | Published - Aug 2015 |
Keywords
- Bottleneck section
- differential evolution (DE)
- railway traffic management
- train rescheduling
ASJC Scopus subject areas
- Automotive Engineering
- Computer Science Applications
- Mechanical Engineering