Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • 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
Hump Yard Track Allocation with Temporary Car Storage
RISE - Research Institutes of Sweden, ICT, SICS.ORCID iD: 0000-0003-1597-6738
2010 (English)Report (Other academic)
Abstract [en]

In rail freight operation, freight cars need to be separated and reformed into new trains at hump yards. The classification procedure is complex and time consuming, and hump yards often constitute bottlenecks in the rail freight network. One of the problems is that planning for the allocation of tracks at hump yards is difficult, given that the planner has limited resources (tracks, shunting engines, etc.) and needs to foresee the future capacity requirements when planning for the current inbound trains. In this paper, we consider the problem of allocating classification tracks in a rail freight hump yard for arriving and departing trains. Arrival and departure times are predetermined and may originate in timetables or estimated arrival and departure times (in case of disturbances in the rail system). The core problem can be formulated as a special list coloring problem. We focus on an extension where individual cars can temporarily be stored on a special subset of the tracks. We model the problem using mixed integer programming, and also propose several heuristics that can quickly give feasible track allocations. As a case study, we consider a real-world problem instance from the Hallsberg Rangerbangård hump yard in Sweden. Planning over horizons over two to four days, we obtain feasible solutions from both the exact and heuristic approaches that allow all outgoing trains to leave on time.

Place, publisher, year, edition, pages
Kista, Sweden: Swedish Institute of Computer Science , 2010, 11.
Series
SICS Technical Report, ISSN 1100-3154 ; 2010:09
National Category
Computer and Information Sciences
Identifiers
URN: urn:nbn:se:ri:diva-23776OAI: oai:DiVA.org:ri-23776DiVA: diva2:1042853
Projects
RanPlan
Funder
Swedish Transport Administration
Note

This work was supported by Trafikverket under FUD grant F 09-11546/AL50 and by the Swiss National Science Foundation (SNF) under grant 200021-125033/1.

Available from: 2016-10-31 Created: 2016-10-31 Last updated: 2018-01-14Bibliographically approved

Open Access in DiVA

fulltext(493 kB)5 downloads
File information
File name FULLTEXT01.pdfFile size 493 kBChecksum SHA-512
1db1312eafde712d44ebf3ce90794aef791ad45168237dc7036c2fbdf2a6bdec4cd0540cd13d0128d69c867ee1f9fc7f1961fa170a6430d28f6bffe81522ea82
Type fulltextMimetype application/pdf

Search in DiVA

By author/editor
Bohlin, Markus
By organisation
SICS
Computer and Information Sciences

Search outside of DiVA

GoogleGoogle Scholar
Total: 5 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

urn-nbn

Altmetric score

urn-nbn
Total: 9 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • 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