mdh.sePublikationer
Ändra sökning
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Hump Yard Track Allocation with Temporary Car Storage
Mälardalens högskola, Akademin för innovation, design och teknik. SICS, Sweden.ORCID-id: 0000-0003-1597-6738
Mälardalens högskola, Akademin för innovation, design och teknik. ETH, Suisse.
ETH, Suisse.
Mälardalens högskola, Akademin för innovation, design och teknik. ETH, Suisse.
2011 (Engelska)Ingår i: 4th International Seminar on Railway Operations Modelling and Analysis, 2011Konferensbidrag, Publicerat paper (Refereegranskat)
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 hump yards constitute bottlenecks in the rail freight network, often causing outbound trains to be delayed. 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 with predetermined arrival and departure times. 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. An extension where individual cars can temporarily be stored on a special subset of the tracks is also considered. 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 Rangerbangard 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.

Ort, förlag, år, upplaga, sidor
2011.
Nationell ämneskategori
Datorsystem
Identifikatorer
URN: urn:nbn:se:mdh:diva-13538OAI: oai:DiVA.org:mdh-13538DiVA, id: diva2:466078
Konferens
4th International Seminar on Railway Operations Modelling and Analysis, Rome, Italy, 2011
Tillgänglig från: 2011-12-15 Skapad: 2011-12-15 Senast uppdaterad: 2015-07-31Bibliografiskt granskad

Open Access i DiVA

Fulltext saknas i DiVA

Personposter BETA

Bohlin, Markus

Sök vidare i DiVA

Av författaren/redaktören
Bohlin, MarkusFlier, HolgerMaue, Jens
Av organisationen
Akademin för innovation, design och teknik
Datorsystem

Sök vidare utanför DiVA

GoogleGoogle Scholar

urn-nbn

Altmetricpoäng

urn-nbn
Totalt: 52 träffar
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf