Ä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
RISE - Research Institutes of Sweden, ICT, SICS.ORCID-id: 0000-0003-1597-6738
2011 (Engelska)Konferensbidrag, 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 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.

Ort, förlag, år, upplaga, sidor
2011, 12.
Nationell ämneskategori
Data- och informationsvetenskap
Identifikatorer
URN: urn:nbn:se:ri:diva-23905OAI: oai:DiVA.org:ri-23905DiVA, id: diva2:1042983
Konferens
4th International Seminar on Railway Operations Modelling and Analysis
Projekt
RANPLANTillgänglig från: 2016-10-31 Skapad: 2016-10-31 Senast uppdaterad: 2020-01-29Bibliografiskt granskad

Open Access i DiVA

fulltext(537 kB)311 nedladdningar
Filinformation
Filnamn FULLTEXT01.pdfFilstorlek 537 kBChecksumma SHA-512
9b113a287348ce8cb160eb23f0152a7fc35875a4bd67f34ea50ccb841d8e77af847e548627898cbe8561dd87b6fbe1e46bc0cf05cb1ee2db274aea0a31ea24f2
Typ fulltextMimetyp application/pdf

Person

Bohlin, Markus

Sök vidare i DiVA

Av författaren/redaktören
Bohlin, Markus
Av organisationen
SICS
Data- och informationsvetenskap

Sök vidare utanför DiVA

GoogleGoogle Scholar
Totalt: 311 nedladdningar
Antalet nedladdningar är summan av nedladdningar för alla fulltexter. Det kan inkludera t.ex tidigare versioner som nu inte längre är tillgängliga.

urn-nbn

Altmetricpoäng

urn-nbn
Totalt: 374 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