Planned maintenance
A system upgrade is planned for 13/12-2023, at 12:00-13:00. During this time DiVA will be unavailable.
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • 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
An Optimization Approach for On-Demand Railway Slot Allocation
Linköpings universitet, SWE.
Blekinge Institute of Technology, Faculty of Computing, Department of Computer Science.ORCID iD: 0000-0002-8373-8398
2017 (English)Conference paper, Published paper (Refereed)
Abstract [en]

This paper addresses a significant challenge experienced by infrastructure managers concerninghandling and scheduling slot requests for additional trains, or urgent track maintenance,after the master timetable has been finalized. In congested railway networks, wherepassenger trains share the tracks with freight trains and where the freight train operatorscannot fully predict the actual need for access to train slots long in advance, there is aneed for a flexible and effective timetabling revision process. Since the re-scheduling oftraffic and maintenance is a demanding task, the benefits of using computational schedulingsupport is evident. From the perspective of an infrastructure manager, we propose andexperimentally evaluate an optimization-based approach for assessment and scheduling ofadditional slot requests. When inserting several trains, the relations between time and routeoverlap as well as direction of trains, and the required computation time are investigated.The optimization-based approach relies on a Mixed Integer Linear Programming formulation.In this model, the explicit capacity restrictions of line segments and station tracks,including track and platform length, are considered. This model also permits bidirectionaltraffic on all lines where relevant. The experimental results show that optimal solutions canbe retrieved quickly in many scenarios, while for certain scenarios the proposed approachis too time-consuming. The required computation time is very dependent on the propertiesof the inserted train and maintenance slots, respectively.

Place, publisher, year, edition, pages
2017.
Keywords [en]
Timetabling, Scheduling, Slot Allocation, Robustness, Railway Traffic
National Category
Transport Systems and Logistics
Identifiers
URN: urn:nbn:se:bth-20957OAI: oai:DiVA.org:bth-20957DiVA, id: diva2:1521177
Conference
7th International Conference on Railway Operations Modelling and Analysis-RailLille2017, April 4-7, 2017, Lille, France
Funder
Swedish Transport Administration
Note

open access

Available from: 2021-01-22 Created: 2021-01-22 Last updated: 2022-05-25Bibliographically approved

Open Access in DiVA

fulltext(219 kB)102 downloads
File information
File name FULLTEXT01.pdfFile size 219 kBChecksum SHA-512
1e8d5f43bf1315f0a8b9c56bc1a067bedbfe85515e9c47532dbf021b909e4575498afa910a0495eed5423fee253dcfe950decaecb07761ba743ecfa3047a7a85
Type fulltextMimetype application/pdf

Authority records

Törnquist Krasemann, Johanna

Search in DiVA

By author/editor
Törnquist Krasemann, Johanna
By organisation
Department of Computer Science
Transport Systems and Logistics

Search outside of DiVA

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

urn-nbn

Altmetric score

urn-nbn
Total: 112 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • 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