Shunting passenger trains : getting ready for departure

J.M. Akker, van den, H. Baarsma, J.L. Hurink, M.S. Modelski, J.J. Paulus, I.C. Reijnen, D.A. Roozemond, J. Schreuder

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademic

110 Downloads (Pure)


In this paper we consider the problem of shunting train units on a railway station. Train units arrive at and depart from the station according to a given train schedule and in between the units may have to be stored at the station. The assignment of arriving to departing train units (called matching) and the scheduling of the movements to realize this matching is called shunting. The goal is to realize the shunting using a minimal number of shunt movements. For a restricted version of this problem an ILP approach has been presented in the literature. In this paper, we consider the general shunting problem and derive a greedy heuristic approach and an exact solution method based on dynamic programming. Both methods are flexible in the sense that they allow the incorporation of practical planning rules and may be extended to cover additional requirements from practice.
Original languageEnglish
Title of host publicationProceedings of the 63rd European Study Group Mathematics with Industry (SWI 2008, Enschede, The Netherlands, January 28-February 1, 2008)
EditorsO. Bokhove, J.L. Hurink, G. Meinsma, C.C. Stolk, M.H. Vellekoop
Place of PublicationAmsterdam
PublisherCentrum voor Wiskunde en Informatica
ISBN (Print)978-90-365-2779-8
Publication statusPublished - 2008

Publication series

NameCWI Syllabus


Dive into the research topics of 'Shunting passenger trains : getting ready for departure'. Together they form a unique fingerprint.

Cite this