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 language | English (US) |
|---|---|
| Pages (from-to) | 208-234 |
| Number of pages | 27 |
| Journal | Transportation Research Part B: Methodological |
| Volume | 67 |
| DOIs | |
| State | Published - 2014 |
Fingerprint
Keywords
- Cumulative flow variable
- Lagrangian relaxation
- Rail network
- Train dispatching
ASJC Scopus subject areas
- Management Science and Operations Research
- Transportation
Cite this
Simultaneous train rerouting and rescheduling on an N-track network : A model reformulation with network-based cumulative flow variables. / Meng, Lingyun; Zhou, Xuesong.
In: Transportation Research Part B: Methodological, Vol. 67, 2014, p. 208-234.Research output: Contribution to journal › Article
}
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
VL - 67
SP - 208
EP - 234
JO - Transportation Research, Series B: Methodological
JF - Transportation Research, Series B: Methodological
SN - 0191-2615
ER -