Modeling and solving real-time train rescheduling problems in railway bottleneck sections

Research output: Contribution to journalArticlepeer-review

Standard

Harvard

APA

Vancouver

Author

Bibtex

@article{d8189b05083942b48d7f9e3ea7ec2c73,
title = "Modeling and solving real-time train rescheduling problems in railway bottleneck sections",
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.",
keywords = "Bottleneck section, differential evolution (DE), railway traffic management, train rescheduling",
author = "Lei Chen and Clive Roberts and Felix Schmid and Edward Stewart",
year = "2015",
month = aug,
doi = "10.1109/TITS.2014.2379617",
language = "English",
volume = "16",
pages = "1896--1904",
journal = "IEEE Transactions on Intelligent Transportation Systems ",
issn = "1524-9050",
publisher = "Institute of Electrical and Electronics Engineers (IEEE)",
number = "4",

}

RIS

TY - JOUR

T1 - Modeling and solving real-time train rescheduling problems in railway bottleneck sections

AU - Chen, Lei

AU - Roberts, Clive

AU - Schmid, Felix

AU - Stewart, Edward

PY - 2015/8

Y1 - 2015/8

N2 - 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.

AB - 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.

KW - Bottleneck section

KW - differential evolution (DE)

KW - railway traffic management

KW - train rescheduling

UR - http://www.scopus.com/inward/record.url?scp=84938794494&partnerID=8YFLogxK

U2 - 10.1109/TITS.2014.2379617

DO - 10.1109/TITS.2014.2379617

M3 - Article

VL - 16

SP - 1896

EP - 1904

JO - IEEE Transactions on Intelligent Transportation Systems

JF - IEEE Transactions on Intelligent Transportation Systems

SN - 1524-9050

IS - 4

ER -