Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Optimization Methods for Multistage Freight Train Formation
RISE - Research Institutes of Sweden, ICT, SICS.ORCID iD: 0000-0003-1597-6738
RISE, Swedish ICT, SICS.ORCID iD: 0000-0003-4456-9453
Show others and affiliations
2015 (English)In: Transportation Science, ISSN 0041-1655, E-ISSN 1526-5447Article in journal (Refereed) Published
Abstract [en]

This paper considers mathematical optimization for the multistage train formation problem, which at the core is the allocation of classification yard formation tracks to outbound freight trains, subject to realistic constraints on train scheduling, arrival and departure timeliness, and track capacity. The problem formulation allows the temporary storage of freight cars on a dedicated mixed-usage track. This real-world practice increases the capacity of the yard, measured in the number of simultaneous trains that can be successfully handled. Two optimization models are proposed and evaluated for the multistage train formation problem. The first one is a column-based integer programming model, which is solved using branch and price. The second model is a simplified reformulation of the first model as an arc-indexed integer linear program, which has the same linear programming relaxation as the first model. Both models are adapted for rolling horizon planning and evaluated on a five-month historical data set from the largest freight yard in Scandinavia. From this data set, 784 instances of different types and lengths, spanning from two to five days, were created. In contrast to earlier approaches, all instances could be solved to optimality using the two models. In the experiments, the arc-indexed model proved optimality on average twice as fast as the column-based model for the independent instances, and three times faster for the rolling horizon instances. For the arc-indexed model, the average solution time for a reasonably sized planning horizon of three days was 16 seconds. Regardless of size, no instance took longer than eight minutes to be solved. The results indicate that optimization approaches are suitable alternatives for scheduling and track allocation at classification yards.

Place, publisher, year, edition, pages
Institute for Operations Research and the Management Sciences , 2015, 6.
National Category
Computer and Information Sciences
Identifiers
URN: urn:nbn:se:ri:diva-24522DOI: 10.1287/trsc.2014.0580OAI: oai:DiVA.org:ri-24522DiVA, id: diva2:1043606
Projects
RANPLANAvailable from: 2016-10-31 Created: 2016-10-31 Last updated: 2018-08-16Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full texthttp

Authority records BETA

Bohlin, MarkusGestrelius, Sara

Search in DiVA

By author/editor
Bohlin, MarkusGestrelius, Sara
By organisation
SICSSICS
In the same journal
Transportation Science
Computer and Information Sciences

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 23 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
v. 2.35.4