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
Towards a comprehensive model for track allocation and roll-time scheduling at marshalling yards
RISE - Research Institutes of Sweden, ICT, SICS.
RISE - Research Institutes of Sweden, ICT, SICS.
RISE - Research Institutes of Sweden, ICT, SICS.
RISE - Research Institutes of Sweden, ICT, SICS.
2017 (English)In: Journal of Rail Transport Planning & Management, ISSN 2210-9706, E-ISSN 2210-9714Article in journal (Refereed) In press
Abstract [en]

This paper considers multi-stage train formation with mixed usage tracks at a marshalling yard without departure yard. A novel integer programming model for scheduling shunting tasks as well as allocating arrival yard tracks and classification bowl tracks is presented. By taking a comprehensive view of the marshalling yard operations, more effective schedules can be found, and a variety of characteristics can be optimised, including shunting work effort, number or cost of tracks, and shunting task start times. Two different objective functions are evaluated: minimising work effort in terms of wagon pull-backs and minimising track costs. A procedure for finding a hot-start solution with few wagon pull-backs is also presented. The proposed model is tested on real data from Sävenäs marshalling yard in Sweden. The results show that the method is able to return an optimal schedule for a planning period of 4 days if the hot-start solution is optimal or the remaining problem is tractable for the heuristics in CPLEX.

Place, publisher, year, edition, pages
2017.
Keyword [en]
Integer programming, Marshalling, Optimisation, Railways, Shunting, Classification yards, Heuristic methods, Optimization, Scheduling, Vehicles, Comprehensive model, Integer programming models, Marshalling yards, Objective functions, Optimisations
National Category
Computer and Information Science
Identifiers
URN: urn:nbn:se:ri:diva-31095DOI: 10.1016/j.jrtpm.2017.06.002Scopus ID: 2-s2.0-85021855568OAI: oai:DiVA.org:ri-31095DiVA: diva2:1136554
Available from: 2017-08-28 Created: 2017-08-28 Last updated: 2017-08-28Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopus
By organisation
SICS
In the same journal
Journal of Rail Transport Planning & Management
Computer and Information Science

Search outside of DiVA

GoogleGoogle Scholar

Altmetric score

Total: 1 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.27.0