Home > Research > Publications & Outputs > A set packing inspired method for real-time jun...
View graph of relations

A set packing inspired method for real-time junction train routing

Research output: Contribution to Journal/MagazineJournal articlepeer-review

Published

Standard

A set packing inspired method for real-time junction train routing. / Lusby, Richard M.; Larsen, Jesper; Ehrgott, Matthias et al.
In: Computers and Operations Research, Vol. 40, No. 3, 01.03.2013, p. 713-724.

Research output: Contribution to Journal/MagazineJournal articlepeer-review

Harvard

Lusby, RM, Larsen, J, Ehrgott, M & Ryan, DM 2013, 'A set packing inspired method for real-time junction train routing', Computers and Operations Research, vol. 40, no. 3, pp. 713-724. https://doi.org/10.1016/j.cor.2011.12.004

APA

Lusby, R. M., Larsen, J., Ehrgott, M., & Ryan, D. M. (2013). A set packing inspired method for real-time junction train routing. Computers and Operations Research, 40(3), 713-724. https://doi.org/10.1016/j.cor.2011.12.004

Vancouver

Lusby RM, Larsen J, Ehrgott M, Ryan DM. A set packing inspired method for real-time junction train routing. Computers and Operations Research. 2013 Mar 1;40(3):713-724. doi: 10.1016/j.cor.2011.12.004

Author

Lusby, Richard M. ; Larsen, Jesper ; Ehrgott, Matthias et al. / A set packing inspired method for real-time junction train routing. In: Computers and Operations Research. 2013 ; Vol. 40, No. 3. pp. 713-724.

Bibtex

@article{0a280d0e1a094410a892bad24654317b,
title = "A set packing inspired method for real-time junction train routing",
abstract = "Efficiently coordinating the often large number of interdependent, timetabled train movements on a railway junction, while satisfying a number of operational requirements, is one of the most important problems faced by a railway company. The most critical variant of the problem arises on a daily basis at major railway junctions where disruptions to rail traffic make the planned schedule/routing infeasible and rolling stock planners are forced to re-schedule/re-route trains in order to recover feasibility. The dynamic nature of the problem means that good solutions must be obtained quickly. In this paper we describe a set packing inspired formulation of this problem and develop a branch-and-price based solution approach. A real life test instance arising in Germany and supplied by the major German railway company, Deutsche Bahn, indicates the efficiency of the proposed approach by confirming that practical problems can be solved to within a few percent of optimality in reasonable time.",
keywords = "Train routing, Disruption management , Duality , Optimization",
author = "Lusby, {Richard M.} and Jesper Larsen and Matthias Ehrgott and Ryan, {David M.}",
year = "2013",
month = mar,
day = "1",
doi = "10.1016/j.cor.2011.12.004",
language = "English",
volume = "40",
pages = "713--724",
journal = "Computers and Operations Research",
issn = "0305-0548",
publisher = "Elsevier Ltd",
number = "3",

}

RIS

TY - JOUR

T1 - A set packing inspired method for real-time junction train routing

AU - Lusby, Richard M.

AU - Larsen, Jesper

AU - Ehrgott, Matthias

AU - Ryan, David M.

PY - 2013/3/1

Y1 - 2013/3/1

N2 - Efficiently coordinating the often large number of interdependent, timetabled train movements on a railway junction, while satisfying a number of operational requirements, is one of the most important problems faced by a railway company. The most critical variant of the problem arises on a daily basis at major railway junctions where disruptions to rail traffic make the planned schedule/routing infeasible and rolling stock planners are forced to re-schedule/re-route trains in order to recover feasibility. The dynamic nature of the problem means that good solutions must be obtained quickly. In this paper we describe a set packing inspired formulation of this problem and develop a branch-and-price based solution approach. A real life test instance arising in Germany and supplied by the major German railway company, Deutsche Bahn, indicates the efficiency of the proposed approach by confirming that practical problems can be solved to within a few percent of optimality in reasonable time.

AB - Efficiently coordinating the often large number of interdependent, timetabled train movements on a railway junction, while satisfying a number of operational requirements, is one of the most important problems faced by a railway company. The most critical variant of the problem arises on a daily basis at major railway junctions where disruptions to rail traffic make the planned schedule/routing infeasible and rolling stock planners are forced to re-schedule/re-route trains in order to recover feasibility. The dynamic nature of the problem means that good solutions must be obtained quickly. In this paper we describe a set packing inspired formulation of this problem and develop a branch-and-price based solution approach. A real life test instance arising in Germany and supplied by the major German railway company, Deutsche Bahn, indicates the efficiency of the proposed approach by confirming that practical problems can be solved to within a few percent of optimality in reasonable time.

KW - Train routing

KW - Disruption management

KW - Duality

KW - Optimization

U2 - 10.1016/j.cor.2011.12.004

DO - 10.1016/j.cor.2011.12.004

M3 - Journal article

VL - 40

SP - 713

EP - 724

JO - Computers and Operations Research

JF - Computers and Operations Research

SN - 0305-0548

IS - 3

ER -