Endre søk
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
A Heuristic Approach to Solving the Train Traffic Re-Scheduling Problem in Real Time
Blekinge Tekniska Högskola, Fakulteten för datavetenskaper, Institutionen för datalogi och datorsystemteknik.
Blekinge Tekniska Högskola, Fakulteten för datavetenskaper, Institutionen för datalogi och datorsystemteknik.
2018 (engelsk)Inngår i: Algorithms, ISSN 1999-4893, E-ISSN 1999-4893, ISSN 1999-4893, Vol. 11, nr 4, s. 1-18, artikkel-id 55Artikkel i tidsskrift (Fagfellevurdert) 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.

sted, utgiver, år, opplag, sider
2018. Vol. 11, nr 4, s. 1-18, artikkel-id 55
Emneord [en]
railway traffic; disturbance management; real-time re-scheduling; job-shop scheduling; optimization; alternative graph
HSV kategori
Identifikatorer
URN: urn:nbn:se:bth-16113DOI: 10.3390/a11040055ISI: 000435177500022OAI: oai:DiVA.org:bth-16113DiVA, id: diva2:1200413
Prosjekter
FloatBLIXTEN
Forskningsfinansiär
Swedish Transport Administration
Merknad

open access

Tilgjengelig fra: 2018-04-24 Laget: 2018-04-24 Sist oppdatert: 2019-11-14bibliografisk kontrollert

Open Access i DiVA

fulltext(1303 kB)114 nedlastinger
Filinformasjon
Fil FULLTEXT01.pdfFilstørrelse 1303 kBChecksum SHA-512
2460185abbc4303bad793af1dbcd966f12d4a22e16ea90adb6934f054c83a889a95aeca56984684c94b97ab77b86b6fae2de019f190bf3e2c68ba8d17a45d1b5
Type fulltextMimetype application/pdf

Andre lenker

Forlagets fulltekstA Heuristic Approach to Solving the Train Traffic Re-Scheduling Problem in Real Time

Personposter BETA

Törnquist Krasemann, Johanna

Søk i DiVA

Av forfatter/redaktør
Gholami, OmidTörnquist Krasemann, Johanna
Av organisasjonen
I samme tidsskrift
Algorithms

Søk utenfor DiVA

GoogleGoogle Scholar
Totalt: 114 nedlastinger
Antall nedlastinger er summen av alle nedlastinger av alle fulltekster. Det kan for eksempel være tidligere versjoner som er ikke lenger tilgjengelige

doi
urn-nbn

Altmetric

doi
urn-nbn
Totalt: 406 treff
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf