eprintid: 264
rev_number: 14
eprint_status: archive
userid: 7
dir: disk0/00/00/02/64
datestamp: 2009-11-09 19:13:28
lastmod: 2015-05-29 19:52:46
status_changed: 2009-11-09 19:13:28
type: report
metadata_visibility: show
item_issues_count: 0
creators_name: van den Akker, Marjan
creators_name: Baarsma, Hilbrandt
creators_name: Hurink, Johann
creators_name: Modelski, Maciej
creators_name: Jan Paulus, Jacob
creators_name: Reijnen, Ingrid
creators_name: Roozemond, Dan
creators_name: Schreuder, Jan
title: Shunting passenger trains: getting ready for departure
ispublished: pub
subjects: transport
studygroups: esgi63
companyname: Nederlandse Spoorwegen NS
full_text_status: public
abstract: 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.
date: 2008
citation:   van den Akker, Marjan and Baarsma, Hilbrandt and Hurink, Johann and Modelski, Maciej and Jan Paulus, Jacob and Reijnen, Ingrid and Roozemond, Dan and Schreuder, Jan  (2008) Shunting passenger trains: getting ready for departure.  [Study Group Report]     
document_url: http://miis.maths.ox.ac.uk/miis/264/1/ns.pdf
document_url: http://miis.maths.ox.ac.uk/miis/264/2/ns-report.pdf