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
A Heuristic Approach to Solving the Train Traffic Re-Scheduling Problem in Real Time
Blekinge Institute of Technology, Faculty of Computing, Department of Computer Science and Engineering.
Blekinge Institute of Technology, Faculty of Computing, Department of Computer Science and Engineering.
2018 (English)In: Algorithms, ISSN 1999-4893, E-ISSN 1999-4893, ISSN 1999-4893, Vol. 11, no 4, p. 1-18, article id 55Article in journal (Refereed) Published
Abstract [en]

Effectiveness in managing disturbances and disruptions in railway traffic networks, when they inevitably do occur, is a significant challenge, both from a practical and theoretical perspective. In this paper, we propose a heuristic approach for solving the real-time train traffic re-scheduling problem. This problem is here interpreted as a blocking job-shop scheduling problem, and a hybrid of the mixed graph and alternative graph is used for modelling the infrastructure and traffic dynamics on a mesoscopic level. A heuristic algorithm is developed and applied to resolve the conflicts by re-timing, re-ordering, and locally re-routing the trains. A part of the Southern Swedish railway network from Karlskrona centre to Malmö city is considered for an experimental performance assessment of the approach. The network consists of 290 block sections, and for a one-hour time horizon with around 80 active trains, the algorithm generates a solution in less than ten seconds. A benchmark with the corresponding mixed-integer program formulation, solved by commercial state-of-the-art solver Gurobi, is also conducted to assess the optimality of the generated solutions.

Place, publisher, year, edition, pages
switzerland, 2018. Vol. 11, no 4, p. 1-18, article id 55
Keyword [en]
railway traffic; disturbance management; real-time re-scheduling; job-shop scheduling; optimization; alternative graph
National Category
Transport Systems and Logistics
Identifiers
URN: urn:nbn:se:bth-16113DOI: 10.3390/a11040055OAI: oai:DiVA.org:bth-16113DiVA, id: diva2:1200413
Projects
FloatBLIXTEN
Funder
Swedish Transport Administration
Note

open access

Available from: 2018-04-24 Created: 2018-04-24 Last updated: 2018-04-25Bibliographically approved

Open Access in DiVA

fulltext(1303 kB)5 downloads
File information
File name FULLTEXT01.pdfFile size 1303 kBChecksum SHA-512
2460185abbc4303bad793af1dbcd966f12d4a22e16ea90adb6934f054c83a889a95aeca56984684c94b97ab77b86b6fae2de019f190bf3e2c68ba8d17a45d1b5
Type fulltextMimetype application/pdf

Other links

Publisher's full textA Heuristic Approach to Solving the Train Traffic Re-Scheduling Problem in Real Time

Authority records BETA

Törnquist Krasemann, Johanna

Search in DiVA

By author/editor
Gholami, OmidTörnquist Krasemann, Johanna
By organisation
Department of Computer Science and Engineering
In the same journal
Algorithms
Transport Systems and Logistics

Search outside of DiVA

GoogleGoogle Scholar
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

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 22 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