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
A parallel heuristic for fast train dispatching during railway traffic disturbances: Early results
Blekinge Institute of Technology, School of Computing.
Blekinge Institute of Technology, School of Computing.
Blekinge Institute of Technology, School of Computing.
2012 (English)Conference paper, Published paper (Refereed)
Abstract [en]

Railways are an important part of the infrastructure in most countries. As the railway networks become more and more saturated, even small traffic disturbances can propagate and have severe consequences. Therefore, efficient re-scheduling support for the traffic managers is needed. In this paper, the train real-time re-scheduling problem is studied in order to minimize the total delay, subject to a set of safety and operational constraints. We propose a parallel greedy algorithm based on a depth-first branch-and-bound search strategy. A number of comprehensive numerical experiments are conducted to compare the parallel implementation to the sequential implementation of the same algorithm in terms of the quality of the solution and the number of nodes evaluated. The comparison is based on 20 disturbance scenarios from three different types of disturbances. Our results show that the parallel algorithm; (i) efficiently covers a larger portion of the search space by exchanging information about improvements, and (ii) finds better solutions for more complicated disturbances such as infrastructure problems. Our results show that the parallel implementation significantly improves the solution for 5 out of 20 disturbance scenarios, as compared to the sequential algorithm.

Place, publisher, year, edition, pages
Vilamoura, Algarve, 2012.
Keyword [en]
Disturbance management, Multiprocessor, Optimization, Parallel computing, Railway traffic, Re-scheduling
National Category
Software Engineering Computer Science
Identifiers
URN: urn:nbn:se:bth-7060Local ID: oai:bth.se:forskinfoE904D0A9EED2D039C1257AC5004E3D5AISBN: 978-989842597-3 (print)OAI: oai:DiVA.org:bth-7060DiVA: diva2:834639
Conference
1st International Conference on Operations Research and Enterprise Systems, ICORES
Available from: 2012-12-20 Created: 2012-11-29 Last updated: 2016-09-09Bibliographically approved

Open Access in DiVA

fulltext(295 kB)92 downloads
File information
File name FULLTEXT01.pdfFile size 295 kBChecksum SHA-512
95199b9b2e53cac505e8d3909013c0dcc3acb08c4ef04caf823eea8fea0040ec3333730526880fa608e7246071cf54760daf5d30ffdb7d582beb3fcd7430b3c9
Type fulltextMimetype application/pdf

Authority records BETA

Iqbal, Syed Muhammad ZeeshanGrahn, HåkanTörnquist Krasemann,, Johanna

Search in DiVA

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

Search outside of DiVA

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

isbn
urn-nbn

Altmetric score

isbn
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