Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Simulation of planning strategies for track allocation at marshalling yards
KTH.
2013 (English)In: Computational methods and experimental measurements XVI, WIT Press, 2013, 465-475 p.Conference paper, Published paper (Refereed)
Abstract [en]

Planning the operational procedures in a railway marshalling yard is a complex problem. When a train arrives at a marshalling yard, it is uncoupled at an arrival yard and then its cars are rolled to a classification yard. All cars should eventually be rolled to the classification track that has been assigned to the train they're supposed to depart with. However, there is normally not enough capacity to compound all trains at once. In Sweden, cars arriving before a track has been assigned to their train can be stored on separate tracks called mixing tracks. All cars on mixing tracks will be pulled back to the arrival yard, and then rolled to the classification yard again to allow for reclassification. Today all procedures are planned by experienced dispatchers, but there are no documented strategies or guidelines for efficient manual planning. The aim of this paper is to examine operational planning strategies that could help dispatchers find a feasible marshalling schedule that minimizes unnecessary mixing. In order to achieve this goal, two different online planning strategies have been tested using deterministic and stochastic simulation. The Hallsberg marshalling yard was used as a case study, and was simulated for the time period between December 2010 and May 2011. The first tested strategy simply assigns tracks to trains on a first come-first served basis, while the second strategy uses time limits to determine when tracks should be assigned to departing trains. The online planning algorithms have been compared with an offline optimized track allocation. The results from both the deterministic and the stochastic simulation show that the optimized allocation is better than all online strategies and that the second strategy with a time limit of 32 hours is the best online method.

Place, publisher, year, edition, pages
WIT Press, 2013. 465-475 p.
Series
WIT Transactions on Modelling and Simulation, ISSN 1743-355X ; 55
Keyword [en]
Marshalling, Marshalling yards, Railways, Simulation, Operational planning, Operational procedures, Optimized allocation, Stochastic simulations
National Category
Transport Systems and Logistics
Identifiers
URN: urn:nbn:se:kth:diva-139914DOI: 10.2495/CMEM130381Scopus ID: 2-s2.0-84887595424ISBN: 978-184564732-2 (print)OAI: oai:DiVA.org:kth-139914DiVA: diva2:687887
Conference
16th International Conference on Computational Methods and Experimental Measurements, CMEM 2013; A Coruna; Spain; 2 July 2013 through 4 July 2013
Note

QC 20140115

Available from: 2014-01-15 Created: 2014-01-15 Last updated: 2014-01-15Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopus

Search in DiVA

By author/editor
Khoshniyat, Fahimeh
By organisation
KTH
Transport Systems and Logistics

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 49 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf