Sökning: id:"swepub:oai:DiVA.org:ri-24057" >
Optimal Freight Tra...
Optimal Freight Train Classification using Column Generation
-
- Bohlin, Markus (författare)
- RISE,SICS,Swedish Institute of Computer Science, Sweden
-
- Dahms, Florian (författare)
- RWTH Aachen, Chair of Operations Research, Germany
-
- Flier, Holger (författare)
- ETH Zürich, Institute of Theoretical Computer Science, Switzerland
-
visa fler...
-
- Gestrelius, Sara (författare)
- RISE,SICS,Swedish Institute of Computer Science, Sweden
-
visa färre...
-
(creator_code:org_t)
- 9
- Dagstuhl, Germany : Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 2012
- 2012
- Engelska.
-
Serie: OASICS, 2190-6807
-
Ingår i: 12th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems, September 13, 2012, Ljubljana, Slovenia. - Dagstuhl, Germany : Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik. - 9783939897453 ; , s. 10-22
- Relaterad länk:
-
http://drops.dagstuh...
-
visa fler...
-
http://drops.dagstuh...
-
https://urn.kb.se/re...
-
https://doi.org/10.4...
-
https://urn.kb.se/re...
-
https://urn.kb.se/re...
-
visa färre...
Abstract
Ämnesord
Stäng
- We consider planning of freight train classification at hump yards using integer programming. The problem involves the formation of departing freight trains from arriving trains subject to scheduling and capacity constraints. To increase yard capacity, we allow the temporary storage of early freight cars on specific mixed-usage tracks. The problem has previously been modeled using a direct integer programming model, but this approach did not yield lower bounds of sufficient quality to prove optimality. In this paper, we formulate a new extended integer programming model and design a column generation approach based on branch-and-price to solve problem instances of industrial size. We evaluate the method on historical data from the Hallsberg hump yard in Sweden, and compare the results with previous approaches. The new method managed to find optimal solutions in all of the 192 problem instances tried. Furthermore, no instance took more than 13 minutes to solve to optimality using fairly standard computer hardware.
Ämnesord
- NATURVETENSKAP -- Data- och informationsvetenskap (hsv//swe)
- NATURAL SCIENCES -- Computer and Information Sciences (hsv//eng)
- NATURVETENSKAP -- Data- och informationsvetenskap -- Annan data- och informationsvetenskap (hsv//swe)
- NATURAL SCIENCES -- Computer and Information Sciences -- Other Computer and Information Science (hsv//eng)
Nyckelord
- Classification
- Column generation
- Integer programming
- Marshalling
- Railways
- Scheduling
- Shunting
- Transportation
Publikations- och innehållstyp
- ref (ämneskategori)
- kon (ämneskategori)
Hitta via bibliotek
Till lärosätets databas