Simultaneous train rerouting and rescheduling on an N-track network: A model reformulation with network-based cumulative flow variables

Lingyun Meng, Xuesong Zhou

Research output: Contribution to journalArticle

88 Citations (Scopus)

Abstract

Train dispatching is critical for the punctuality and reliability of rail operations, especially for a complex rail network. This paper develops an innovative integer programming model for the problem of train dispatching on an N-track network by means of simultaneously rerouting and rescheduling trains. Based on a time-space network modeling framework, we first adapt a commonly used big- M method to represent complex "if-then" conditions for train safety headways in a multi-track context. The track occupancy consideration on typical single and double tracks is then reformulated using a vector of cumulative flow variables. This new reformulation technique can provide an efficient decomposition mechanism through modeling track capacities as side constraints which are further dualized through a proposed Lagrangian relaxation solution framework. We further decompose the original complex rerouting and rescheduling problem into a sequence of single train optimization subproblems. For each subproblem, a standard label correcting algorithm is embedded for finding the time dependent least cost path on a time-space network. The resulting dual solutions can be transformed to feasible solutions through priority rules. We present a set of numerical experiments to demonstrate the system-wide performance benefits of simultaneous train rerouting and rescheduling, compared to commonly-used sequential train rerouting and rescheduling approaches.

Original languageEnglish (US)
Pages (from-to)208-234
Number of pages27
JournalTransportation Research Part B: Methodological
Volume67
DOIs
StatePublished - 2014

Fingerprint

Rails
Integer programming
Labels
Decomposition
programming
Train
Rescheduling
Costs
experiment
costs
Experiments
performance
time
Rail
Modeling
Dispatching

Keywords

  • Cumulative flow variable
  • Lagrangian relaxation
  • Rail network
  • Train dispatching

ASJC Scopus subject areas

  • Management Science and Operations Research
  • Transportation

Cite this

@article{dde6844fac3045f781e2c594904a92a0,
title = "Simultaneous train rerouting and rescheduling on an N-track network: A model reformulation with network-based cumulative flow variables",
abstract = "Train dispatching is critical for the punctuality and reliability of rail operations, especially for a complex rail network. This paper develops an innovative integer programming model for the problem of train dispatching on an N-track network by means of simultaneously rerouting and rescheduling trains. Based on a time-space network modeling framework, we first adapt a commonly used big- M method to represent complex {"}if-then{"} conditions for train safety headways in a multi-track context. The track occupancy consideration on typical single and double tracks is then reformulated using a vector of cumulative flow variables. This new reformulation technique can provide an efficient decomposition mechanism through modeling track capacities as side constraints which are further dualized through a proposed Lagrangian relaxation solution framework. We further decompose the original complex rerouting and rescheduling problem into a sequence of single train optimization subproblems. For each subproblem, a standard label correcting algorithm is embedded for finding the time dependent least cost path on a time-space network. The resulting dual solutions can be transformed to feasible solutions through priority rules. We present a set of numerical experiments to demonstrate the system-wide performance benefits of simultaneous train rerouting and rescheduling, compared to commonly-used sequential train rerouting and rescheduling approaches.",
keywords = "Cumulative flow variable, Lagrangian relaxation, Rail network, Train dispatching",
author = "Lingyun Meng and Xuesong Zhou",
year = "2014",
doi = "10.1016/j.trb.2014.05.005",
language = "English (US)",
volume = "67",
pages = "208--234",
journal = "Transportation Research, Series B: Methodological",
issn = "0191-2615",
publisher = "Elsevier Limited",

}

TY - JOUR

T1 - Simultaneous train rerouting and rescheduling on an N-track network

T2 - A model reformulation with network-based cumulative flow variables

AU - Meng, Lingyun

AU - Zhou, Xuesong

PY - 2014

Y1 - 2014

N2 - Train dispatching is critical for the punctuality and reliability of rail operations, especially for a complex rail network. This paper develops an innovative integer programming model for the problem of train dispatching on an N-track network by means of simultaneously rerouting and rescheduling trains. Based on a time-space network modeling framework, we first adapt a commonly used big- M method to represent complex "if-then" conditions for train safety headways in a multi-track context. The track occupancy consideration on typical single and double tracks is then reformulated using a vector of cumulative flow variables. This new reformulation technique can provide an efficient decomposition mechanism through modeling track capacities as side constraints which are further dualized through a proposed Lagrangian relaxation solution framework. We further decompose the original complex rerouting and rescheduling problem into a sequence of single train optimization subproblems. For each subproblem, a standard label correcting algorithm is embedded for finding the time dependent least cost path on a time-space network. The resulting dual solutions can be transformed to feasible solutions through priority rules. We present a set of numerical experiments to demonstrate the system-wide performance benefits of simultaneous train rerouting and rescheduling, compared to commonly-used sequential train rerouting and rescheduling approaches.

AB - Train dispatching is critical for the punctuality and reliability of rail operations, especially for a complex rail network. This paper develops an innovative integer programming model for the problem of train dispatching on an N-track network by means of simultaneously rerouting and rescheduling trains. Based on a time-space network modeling framework, we first adapt a commonly used big- M method to represent complex "if-then" conditions for train safety headways in a multi-track context. The track occupancy consideration on typical single and double tracks is then reformulated using a vector of cumulative flow variables. This new reformulation technique can provide an efficient decomposition mechanism through modeling track capacities as side constraints which are further dualized through a proposed Lagrangian relaxation solution framework. We further decompose the original complex rerouting and rescheduling problem into a sequence of single train optimization subproblems. For each subproblem, a standard label correcting algorithm is embedded for finding the time dependent least cost path on a time-space network. The resulting dual solutions can be transformed to feasible solutions through priority rules. We present a set of numerical experiments to demonstrate the system-wide performance benefits of simultaneous train rerouting and rescheduling, compared to commonly-used sequential train rerouting and rescheduling approaches.

KW - Cumulative flow variable

KW - Lagrangian relaxation

KW - Rail network

KW - Train dispatching

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

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

U2 - 10.1016/j.trb.2014.05.005

DO - 10.1016/j.trb.2014.05.005

M3 - Article

AN - SCOPUS:84902346437

VL - 67

SP - 208

EP - 234

JO - Transportation Research, Series B: Methodological

JF - Transportation Research, Series B: Methodological

SN - 0191-2615

ER -