Shunting of Passenger Train Units in a Railway Station

Authors:
Richard Freling;Ramon M. Lentink;Leo G. Kroon;Dennis Huisman
Affiliations:
-;-;-;-
Venue:
Transportation Science
Year:
2005

Citing 0
Cited 13

Parking buses in a depot using block patterns: A Benders decomposition approach for minimizing type mismatches

Computers and Operations Research
Dispatching Buses in a Depot Using Block Patterns

Transportation Science
Robust rolling stock in rapid transit networks

Computers and Operations Research
Using simulated annealing for determination of the capacity of yard stations in a railway industry

Applied Soft Computing
A capacity test for shunting movements

ATMOS'04 Proceedings of the 4th international Dagstuhl, ATMOS conference on Algorithmic approaches for transportation modeling, optimization, and systems
Platform assignment

ATMOS'04 Proceedings of the 4th international Dagstuhl, ATMOS conference on Algorithmic approaches for transportation modeling, optimization, and systems
Scheduling Freight Trains in Rail-Rail Transshipment Yards

Transportation Science
Railway track allocation: models and methods

OR Spectrum
Approximation algorithms for conflict-free vehicle routing

ESA'11 Proceedings of the 19th European conference on Algorithms
On the online track assignment problem

Discrete Applied Mathematics
New bounds and algorithms for the transshipment yard scheduling problem

Journal of Scheduling
How to park freight trains on rail---rail transshipment yards: the train location problem

OR Spectrum
A Survey on Container Processing in Railway Yards

Transportation Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we introduce the problem of shunting passenger train units in a railway station. Shunting occurs whenever train units are temporarily not needed to operate a given timetable. We discuss several aspects of this problem and focus on two subproblems. We propose mathematical models for the problem and both subproblems, one of which is solved with a solution method based on column generation. Furthermore, we introduce a new efficient and speedy solution technique for pricing problems in column generation algorithms. Finally, we present computational results based on real-life instances from Netherlands Railways.