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
Multi-Strategy Based Train Re-Scheduling During Railway Traffic Disturbances
Blekinge Institute of Technology, School of Computing.
Blekinge Institute of Technology, School of Computing.
Blekinge Institute of Technology, School of Computing.
2013 (English)Conference paper, (Refereed)
Abstract [en]

Disruptions and delays in railway traffic networks due to different types of disturbances is a frequent problem in many countries. When disruptions occur, the train traffic dispatchers may need to re-schedule the traffic and this is often a very demanding and complicated task. To support the train traffic dispatchers, we propose to use a parallelized multi-strategy based greedy algorithm. This paper presents three different parallelization approaches: (i) Single Strategy with a Partitioned List (i.e. the parallel processes originate from different starting points), (ii) Multiple Strategies with a Non-Partitioned List, and (iii) Multiple Strategies with a Partitioned List. We present an evaluation for a busy part of the Swedish railway network based on performance metrics such as the sum of all train delays at their final destinations and the number of delayed trains. The results show that parallelization helps to improve the solution quality. The parallel approach (iii) that combines all re-scheduling strategies with a partitioned list performs best among the three parallel approaches when minimizing the total final delay. The main conclusion is that the multi-strategy based parallel approach significantly improves the solution for 11 out of 20 disturbance scenarios, as compared to the sequential re-scheduling algorithm. The approach also provides an increased stability since it always delivers a feasible solution in short time.

Place, publisher, year, edition, pages
Copenhagen, Denmark: Technical University of Denmark , 2013.
National Category
Computer Science
Identifiers
URN: urn:nbn:se:bth-6846Local ID: oai:bth.se:forskinfo2479F542343187D4C1257C2F004FBF66OAI: oai:DiVA.org:bth-6846DiVA: diva2:834394
Conference
5th International Seminar on Railway Operations Modelling and Analysis (RailCopenhagen)
Available from: 2013-11-29 Created: 2013-11-26 Last updated: 2017-01-13Bibliographically approved

Open Access in DiVA

fulltext(33 kB)29 downloads
File information
File name FULLTEXT01.pdfFile size 33 kBChecksum SHA-512
0de397f509b540eea0c09b50dfacfa77f870f96923a4512e251ab60624f680b222ab4c25a678e5b832ae9829cc1b2b970195c148f94616bf1bf15be6bbc50192
Type fulltextMimetype application/pdf

Search in DiVA

By author/editor
Iqbal, Syed Muhammad ZeeshanGrahn, HåkanTörnquist Krasemann, Johanna
By organisation
School of Computing
Computer Science

Search outside of DiVA

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

Total: 231 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