Change search
ReferencesLink to record
Permanent link

Direct link
Optimized shunting with mixed-usage tracks
RISE, Swedish ICT, SICS. Decisions, Networks and Analytics lab.
RISE, Swedish ICT, SICS. Decisions, Networks and Analytics lab.
Show others and affiliations
Number of Authors: 5
2013 (English)Report (Other academic)
Abstract [en]

We consider the planning of railway freight classification at hump yards, where the problem involves the formation of departing freight train blocks from arriving trains subject to scheduling and capacity constraints. The hump yard layout considered consists of arrival tracks of sufficient length at an arrival yard, a hump, classification tracks of non-uniform and possibly non-sufficient length at a classification yard, and departure tracks of sufficient length. To increase yard capacity, freight cars arriving early can be stored temporarily on specific mixed-usage tracks. The entire hump yard planning process is covered in this paper, and heuristics for arrival and departure track assignment, as well as hump scheduling, have been included to provide the neccessary input data. However, the central problem considered is the classification track allocation problem. This problem has previously been modeled using direct mixed integer programming models, but this approach did not yield lower bounds of sufficient quality to prove optimality. Later attempts focused on a column generation approach based on branch-and-price that could solve problem instances of industrial size. Building upon the column generation approach we introduce a direct arc-based integer programming model, where the arcs are precedence relations between blocks on the same classification track. Further, the most promising models are adapted for rolling-horizon planning. We evaluate the methods on historical data from the Hallsberg shunting yard in Sweden. The results show that the new arc-based model performs as well as the column generation approach. It returns an optimal schedule within the execution time limit for all instances but from one, and executes as fast as the column generation approach. Further, the short execution times of the column generation approach and the arc-indexed model make them suitable for rolling-horizon planning, while the direct mixed integer program proved to be too slow for this. Extended analysis of the results shows that mixing was only required if the maximum number of concurrent trains on the classification yard exceeds 29 (there are 32 available tracks), and that after this point the number of extra car roll-ins increases heavily.

Place, publisher, year, edition, pages
Kista, Sweden: Swedish Institute of Computer Science , 2013, 16.
Series
SICS Technical Report, ISSN 1100-3154 ; 2013:06
National Category
Computer and Information Science
Identifiers
URN: urn:nbn:se:ri:diva-24277OAI: oai:DiVA.org:ri-24277DiVA: diva2:1043357
Available from: 2016-10-31 Created: 2016-10-31

Open Access in DiVA

fulltext(2706 kB)7 downloads
File information
File name FULLTEXT01.pdfFile size 2706 kBChecksum SHA-512
66014b89cb9100753487b99e77056c3407eeeb5f6224ebecabd8573c19dd62755ac685c6dd20c0fda5570804f584c77ce6b1d1cd66278625ff7d0c9e7190e6fb
Type fulltextMimetype application/pdf

Search in DiVA

By author/editor
Dahms, FlorianFlier, Holger
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: 8 hits
ReferencesLink to record
Permanent link

Direct link