Change search
ReferencesLink to record
Permanent link

Direct link
A Parallel DFS Algorithm for Train Re-scheduling During Traffic Disturbances — Early Results
Responsible organisation
2011 (English)Conference 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
URN: urn:nbn:se:bth-7341Local ID: diva2:834948
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)120 downloads
File information
File name FULLTEXT01.pdfFile size 306 kBChecksum SHA-512
Type fulltextMimetype application/pdf

Search in DiVA

By author/editor
Grahn, Håkan
Computer Science

Search outside of DiVA

GoogleGoogle Scholar
Total: 120 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: 125 hits
ReferencesLink to record
Permanent link

Direct link