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
Track Allocation in Freight-Train Classification with Mixed Tracks
Mälardalens högskola, Akademin för innovation, design och teknik.ORCID-id: 0000-0003-1597-6738
ETH Zürich, Institute of Theoretical Computer Science, Switzerland.
ETH Zürich, Institute of Theoretical Computer Science, Switzerland.
ETH Zürich, Institute of Theoretical Computer Science, Switzerland.
2011 (Engelska)Ingår i: OpenAccess Series in Informatics, Volume 20, 2011, 2011, s. 38-51Konferensbidrag, Publicerat paper (Refereegranskat)
Abstract [en]

We consider the process of forming outbound trains from cars of inbound trains at rail-freight hump yards. Given the arrival and departure times as well as the composition of the trains, we study the problem of allocating classification tracks to outbound trains such that every outbound train can be built on a separate classification track. We observe that the core problem can be formulated as a special list coloring problem in interval graphs, which is known to be NP-complete. We focus on an extension where individual cars of different trains can temporarily be stored on a special subset of the tracks. This problem induces several new variants of the list-coloring problem, in which the given intervals can be shortened by cutting off a prefix of the interval. We show that in case of uniform and sufficient track lengths, the corresponding coloring problem can be solved in polynomial time, if the goal is to minimize the total cost associated with cutting off prefixes of the intervals. Based on these results, we devise two heuristics as well as an integer program to tackle the problem. As a case study, we consider a real-world problem instance from the Hallsberg Rangerbangard hump yard in Sweden. Planning over horizons of seven days, we obtain feasible solutions from the integer program in all scenarios, and from the heuristics in most scenarios.

Ort, förlag, år, upplaga, sidor
2011. s. 38-51
Nationell ämneskategori
Datorsystem
Identifikatorer
URN: urn:nbn:se:mdh:diva-13539DOI: 10.4230/OASIcs.ATMOS.2011.38Scopus ID: 2-s2.0-84882963619ISBN: 9783939897330 (tryckt)OAI: oai:DiVA.org:mdh-13539DiVA, id: diva2:466079
Konferens
11th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems, ATMOS 2011; Saarbrucken; Germany; 8 September 2011 through 8 September 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

Övriga länkar

Förlagets fulltextScopus

Personposter BETA

Bohlin, Markus

Sök vidare i DiVA

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

Sök vidare utanför DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetricpoäng

doi
isbn
urn-nbn
Totalt: 62 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