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
Multi-Strategy Based Train Re-Scheduling During Railway Traffic Disturbances
Blekinge Tekniska Högskola, Sektionen för datavetenskap och kommunikation.
Blekinge Tekniska Högskola, Sektionen för datavetenskap och kommunikation.ORCID-id: 0000-0001-9947-1088
Blekinge Tekniska Högskola, Sektionen för datavetenskap och kommunikation.
2013 (engelsk)Konferansepaper, Publicerat paper (Fagfellevurdert)
Abstract [en]

Disruptions and delays in railway traffic networks due to different types of disturbances is a frequent problem in many countries. When disruptions occur, the train traffic dispatchers may need to re-schedule the traffic and this is often a very demanding and complicated task. To support the train traffic dispatchers, we propose to use a parallelized multi-strategy based greedy algorithm. This paper presents three different parallelization approaches: (i) Single Strategy with a Partitioned List (i.e. the parallel processes originate from different starting points), (ii) Multiple Strategies with a Non-Partitioned List, and (iii) Multiple Strategies with a Partitioned List. We present an evaluation for a busy part of the Swedish railway network based on performance metrics such as the sum of all train delays at their final destinations and the number of delayed trains. The results show that parallelization helps to improve the solution quality. The parallel approach (iii) that combines all re-scheduling strategies with a partitioned list performs best among the three parallel approaches when minimizing the total final delay. The main conclusion is that the multi-strategy based parallel approach significantly improves the solution for 11 out of 20 disturbance scenarios, as compared to the sequential re-scheduling algorithm. The approach also provides an increased stability since it always delivers a feasible solution in short time.

sted, utgiver, år, opplag, sider
Copenhagen, Denmark: Technical University of Denmark , 2013.
HSV kategori
Identifikatorer
URN: urn:nbn:se:bth-6846Lokal ID: oai:bth.se:forskinfo2479F542343187D4C1257C2F004FBF66OAI: oai:DiVA.org:bth-6846DiVA, id: diva2:834394
Konferanse
5th International Seminar on Railway Operations Modelling and Analysis (RailCopenhagen)
Tilgjengelig fra: 2013-11-29 Laget: 2013-11-26 Sist oppdatert: 2018-02-02bibliografisk kontrollert

Open Access i DiVA

fulltext(33 kB)277 nedlastinger
Filinformasjon
Fil FULLTEXT01.pdfFilstørrelse 33 kBChecksum SHA-512
0de397f509b540eea0c09b50dfacfa77f870f96923a4512e251ab60624f680b222ab4c25a678e5b832ae9829cc1b2b970195c148f94616bf1bf15be6bbc50192
Type fulltextMimetype application/pdf

Personposter BETA

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

Søk i DiVA

Av forfatter/redaktør
Iqbal, Syed Muhammad ZeeshanGrahn, HåkanTörnquist Krasemann, Johanna
Av organisasjonen

Søk utenfor DiVA

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

urn-nbn

Altmetric

urn-nbn
Totalt: 761 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