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

Authors:
Richard Lusby;Jesper Larsen;David Ryan;Matthias Ehrgott
Affiliations:
Department of Management Engineering, Technical University of Denmark, 2800 Kgs. Lyngby, Denmark;Department of Management Engineering, Technical University of Denmark, 2800 Kgs. Lyngby, Denmark;Department of Engineering Science, The University of Auckland, Auckland 1142, New Zealand;Department of Engineering Science, The University of Auckland, Auckland 1142, New Zealand
Venue:
Transportation Science
Year:
2011

Citing 4
Cited 1

Using Integer Programming to Solve the Train-Platforming Problem

Transportation Science
Modeling train movements through complex rail networks

ACM Transactions on Modeling and Computer Simulation (TOMACS)
Track assignment

Journal of Discrete Algorithms
The Locomotive Routing Problem

Transportation Science

Decomposing combinatorial auctions and set packing problems

Journal of the ACM (JACM)

Quantified Score

Hi-index	0.00

Visualization

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.