Change search
ReferencesLink to record
Permanent link

Direct link
Track Allocation in Freight-Train Classification with Mixed Tracks
RISE, Swedish ICT, SICS. IAM.
RANPLAN.
RANPLAN.
RANPLAN.
Number of Authors: 4
2011 (English)Conference paper (Refereed)
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 Rangerbangård 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.

Place, publisher, year, edition, pages
2011, 12.
National Category
Computer and Information Science
Identifiers
URN: urn:nbn:se:ri:diva-23903OAI: oai:DiVA.org:ri-23903DiVA: diva2:1042981
Conference
11th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems
Projects
RANPLAN
Available from: 2016-10-31 Created: 2016-10-31

Open Access in DiVA

fulltext(568 kB)7 downloads
File information
File name FULLTEXT01.pdfFile size 568 kBChecksum SHA-512
8924ff63608a01d43c1486aa10a4fe33aedd5694d4a7e8a79bc66cb89ebad496311f81964bfd269d44e31b8639cbda14794740c906302b0095220dfe48b86df8
Type fulltextMimetype application/pdf

By organisation
SICS
Computer and Information Science

Search outside of DiVA

GoogleGoogle Scholar
Total: 7 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

Total: 4 hits
ReferencesLink to record
Permanent link

Direct link