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 parallel heuristic for fast train dispatching during railway traffic disturbances: Early results
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.
2012 (engelsk)Konferansepaper, Publicerat paper (Fagfellevurdert)
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. Therefore, efficient re-scheduling support for the traffic managers is needed. In this paper, the train real-time re-scheduling problem is studied in order to minimize the total delay, subject to a set of safety and operational constraints. We propose a parallel greedy algorithm based on a depth-first branch-and-bound search strategy. A number of comprehensive numerical experiments are conducted to compare the parallel implementation to the sequential implementation of the same algorithm in terms of the quality of the solution and the number of nodes evaluated. The comparison is based on 20 disturbance scenarios from three different types of disturbances. Our results show that the parallel algorithm; (i) efficiently covers a larger portion of the search space by exchanging information about improvements, and (ii) finds better solutions for more complicated disturbances such as infrastructure problems. Our results show that the parallel implementation significantly improves the solution for 5 out of 20 disturbance scenarios, as compared to the sequential algorithm.

sted, utgiver, år, opplag, sider
Vilamoura, Algarve, 2012.
Emneord [en]
Disturbance management, Multiprocessor, Optimization, Parallel computing, Railway traffic, Re-scheduling
HSV kategori
Identifikatorer
URN: urn:nbn:se:bth-7060Lokal ID: oai:bth.se:forskinfoE904D0A9EED2D039C1257AC5004E3D5AISBN: 978-989842597-3 (tryckt)OAI: oai:DiVA.org:bth-7060DiVA, id: diva2:834639
Konferanse
1st International Conference on Operations Research and Enterprise Systems, ICORES
Tilgjengelig fra: 2012-12-20 Laget: 2012-11-29 Sist oppdatert: 2018-02-02bibliografisk kontrollert

Open Access i DiVA

fulltext(295 kB)293 nedlastinger
Filinformasjon
Fil FULLTEXT01.pdfFilstørrelse 295 kBChecksum SHA-512
95199b9b2e53cac505e8d3909013c0dcc3acb08c4ef04caf823eea8fea0040ec3333730526880fa608e7246071cf54760daf5d30ffdb7d582beb3fcd7430b3c9
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: 293 nedlastinger
Antall nedlastinger er summen av alle nedlastinger av alle fulltekster. Det kan for eksempel være tidligere versjoner som er ikke lenger tilgjengelige

isbn
urn-nbn

Altmetric

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