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 DFS Algorithm for Train Re-scheduling During Traffic Disturbances — Early Results
Responsible organisation
2011 (English)Conference paper, Published paper (Refereed) Published
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. In this paper, the train re-scheduling problem is studied in order to minimize the final delay for all trains in the scenarios. We propose a parallel algorithm based on a depth-first search branch-and-bound strategy. The parallel algorithm is compared to a sequential algorithm in terms of the quality of the solution and the number of nodes evaluated, as well as to optimal solutions found by Cplex, using 20 disturbance scenarios. Our parallel algorithm significantly improves the solution for 5 out of 20 disturbance scenarios, as compared to the sequential algorithm.

Place, publisher, year, edition, pages
Linköping, Sweden, 2011.
National Category
Computer Science
Identifiers
URN: urn:nbn:se:bth-7341Local ID: oai:bth.se:forskinfoBA57C435F7C5E05BC125797C002E660DOAI: oai:DiVA.org:bth-7341DiVA: diva2:834948
Conference
4th Swedish workshop on Multicore Computing MCC
Available from: 2012-09-18 Created: 2012-01-05 Last updated: 2015-06-30Bibliographically approved

Open Access in DiVA

fulltext(306 kB)275 downloads
File information
File name FULLTEXT01.pdfFile size 306 kBChecksum SHA-512
e4d8837906a664b1d36383fe4ed3af022de70bb6b21eb7b05fd325d6467e62a5159cd206ac3caad63519ff6676fde3ac899d0166aa675113e8d3557a9e57e52c
Type fulltextMimetype application/pdf

Search in DiVA

By author/editor
Grahn, Håkan
Computer Science

Search outside of DiVA

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