liu.seSearch for publications in DiVA
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • 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öping University, Department of Science and Technology, Communications and Transport Systems. Linköping University, Faculty of Science & Engineering.ORCID iD: 0000-0003-3175-7869
Department of Computer Science and Engineering, Blekinge Institute of Technology, Sweden.
2017 (English)Conference paper, Oral presentation only (Other academic)
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
Lille, France, 2017.
Keyword [en]
Timetabling, Scheduling, Slot Allocation, Robustness, Railway Traffic
National Category
Transport Systems and Logistics
Identifiers
URN: urn:nbn:se:liu:diva-142795OAI: oai:DiVA.org:liu-142795DiVA: diva2:1154742
Conference
7th International Conference on Railway Operations Modelling and Analysis-RailLille2017, April 4-7, 2017, Lille, France
Funder
Swedish Transport Administration
Available from: 2017-11-03 Created: 2017-11-03 Last updated: 2017-11-29

Open Access in DiVA

No full text

Search in DiVA

By author/editor
Khoshniyat, Fahimeh
By organisation
Communications and Transport SystemsFaculty of Science & Engineering
Transport Systems and Logistics

Search outside of DiVA

GoogleGoogle Scholar

urn-nbn

Altmetric score

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

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • 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