Home > Research > Publications & Outputs > Routing Trains Through Railway Junctions: A New...
View graph of relations

Routing Trains Through Railway Junctions: A New Set-Packing Approach

Research output: Contribution to Journal/MagazineJournal articlepeer-review

Published

Standard

Routing Trains Through Railway Junctions: A New Set-Packing Approach. / Lusby, Richard M.; Larsen, Jesper; Ryan, David et al.
In: Transportation Science, Vol. 45, No. 2, 01.05.2011, p. 228-245.

Research output: Contribution to Journal/MagazineJournal articlepeer-review

Harvard

Lusby, RM, Larsen, J, Ryan, D & Ehrgott, M 2011, 'Routing Trains Through Railway Junctions: A New Set-Packing Approach', Transportation Science, vol. 45, no. 2, pp. 228-245. https://doi.org/10.1287/trsc.1100.0362

APA

Lusby, R. M., Larsen, J., Ryan, D., & Ehrgott, M. (2011). Routing Trains Through Railway Junctions: A New Set-Packing Approach. Transportation Science, 45(2), 228-245. https://doi.org/10.1287/trsc.1100.0362

Vancouver

Lusby RM, Larsen J, Ryan D, Ehrgott M. Routing Trains Through Railway Junctions: A New Set-Packing Approach. Transportation Science. 2011 May 1;45(2):228-245. doi: 10.1287/trsc.1100.0362

Author

Lusby, Richard M. ; Larsen, Jesper ; Ryan, David et al. / Routing Trains Through Railway Junctions: A New Set-Packing Approach. In: Transportation Science. 2011 ; Vol. 45, No. 2. pp. 228-245.

Bibtex

@article{b58871f0d31a470994a087335bd9a6b0,
title = "Routing Trains Through Railway Junctions: A New Set-Packing Approach",
abstract = "The problem of routing trains through railway junctions is an integral part of railway operations. Large junctions are highly interconnected networks of track where multiple railway lines merge, intersect, and split. The number of possible routings makes this a very complicated problem. We show how the problem can be formulated as a set-packing model with a resource-based constraint system. We prove that this formulation is tighter than the conventional node-packing model, and develop a branch-and-price algorithm that exploits the structure of the set-packing model. A discussion of the variable generation phase, as well as a pricing routine in which these variables are represented by tree structures, is also described. Computational experiments on 25 random timetables show this to be an efficient approach. ",
keywords = "train routing, set-packing model , column generation",
author = "Lusby, {Richard M.} and Jesper Larsen and David Ryan and Matthias Ehrgott",
year = "2011",
month = may,
day = "1",
doi = "10.1287/trsc.1100.0362",
language = "English",
volume = "45",
pages = "228--245",
journal = "Transportation Science",
issn = "0041-1655",
publisher = "INFORMS",
number = "2",

}

RIS

TY - JOUR

T1 - Routing Trains Through Railway Junctions: A New Set-Packing Approach

AU - Lusby, Richard M.

AU - Larsen, Jesper

AU - Ryan, David

AU - Ehrgott, Matthias

PY - 2011/5/1

Y1 - 2011/5/1

N2 - The problem of routing trains through railway junctions is an integral part of railway operations. Large junctions are highly interconnected networks of track where multiple railway lines merge, intersect, and split. The number of possible routings makes this a very complicated problem. We show how the problem can be formulated as a set-packing model with a resource-based constraint system. We prove that this formulation is tighter than the conventional node-packing model, and develop a branch-and-price algorithm that exploits the structure of the set-packing model. A discussion of the variable generation phase, as well as a pricing routine in which these variables are represented by tree structures, is also described. Computational experiments on 25 random timetables show this to be an efficient approach.

AB - The problem of routing trains through railway junctions is an integral part of railway operations. Large junctions are highly interconnected networks of track where multiple railway lines merge, intersect, and split. The number of possible routings makes this a very complicated problem. We show how the problem can be formulated as a set-packing model with a resource-based constraint system. We prove that this formulation is tighter than the conventional node-packing model, and develop a branch-and-price algorithm that exploits the structure of the set-packing model. A discussion of the variable generation phase, as well as a pricing routine in which these variables are represented by tree structures, is also described. Computational experiments on 25 random timetables show this to be an efficient approach.

KW - train routing

KW - set-packing model

KW - column generation

U2 - 10.1287/trsc.1100.0362

DO - 10.1287/trsc.1100.0362

M3 - Journal article

VL - 45

SP - 228

EP - 245

JO - Transportation Science

JF - Transportation Science

SN - 0041-1655

IS - 2

ER -