Ändra sökning
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
A Parallel Re-Scheduling Algorithm for Railway Traffic Disturbance Management --- Initial Results
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.
2011 (Engelska)Konferensbidrag, Publicerat paper (Refereegranskat) Published
Abstract [en]

In Sweden, the railway traffic and demand for track capacity have increased significantly the last years resulting in a high traffic density where even small disturbances propagate. This makes it hard for the traffic managers to overview the consequences of disturbances and their decisions when rescheduling the traffic. In previous research, we have developed and experimentally evaluated a greedy depthfirst search algorithm. This algorithm aims to support the traffic managers by computing alternative rescheduling solutions in order to minimize the train delays. The simulation experiments were based on real traffic data and the algorithm proved to be very effective for many types of disturbances and delivers optimal or close to optimal solutions in a few seconds. However, the experiments also indicated a need for improvements when solving more severe disturbances related to major infrastructure failures. The improvements concern primarily the need to explore larger parts of the search space quickly and to branch more effectively by avoiding exploring non-promising nodes. This paper presents results from an analysis of where and when successful branching decisions are made. The analysis showed that the successful branching decisions were generally made quite far down in the search space tree, but somewhat higher up during more severe disturbance scenarios. We also present an improved version of the greedy algorithm and a parallel implementation of it. The parallelization is composed of eight different threads allocated to one processor each starting to branch at the highest branching level. The experimental results show that it improves the solutions for difficult disturbance scenarios.

Ort, förlag, år, upplaga, sidor
Leuven, Belgium, 2011.
Nyckelord [en]
Railway traffic, Disturbance Management, Re­scheduling, Parallel algorithm, Multi­processor
Nationell ämneskategori
Datavetenskap (datalogi)
Identifikatorer
URN: urn:nbn:se:bth-7154Lokalt ID: oai:bth.se:forskinfo596430DB36638A82C125797C002F3A50OAI: oai:DiVA.org:bth-7154DiVA, id: diva2:834736
Konferens
2nd International Conference on Models and Technologies for Intelligent Transportation Systems (MT-ITS 2011)
Tillgänglig från: 2012-11-28 Skapad: 2012-01-05 Senast uppdaterad: 2018-02-02Bibliografiskt granskad

Open Access i DiVA

fulltext(603 kB)170 nedladdningar
Filinformation
Filnamn FULLTEXT01.pdfFilstorlek 603 kBChecksumma SHA-512
2683a90413f2e27ab091979aed6310bba37e665afb3e8000463a112b3a38f68fe8eb4e34d73c9e344278409fd983b2880e0ab908e7f23fb8bfa28de8023728b3
Typ fulltextMimetyp application/pdf

Personposter BETA

Grahn, Håkan

Sök vidare i DiVA

Av författaren/redaktören
Grahn, Håkan
Av organisationen
Sektionen för datavetenskap och kommunikation
Datavetenskap (datalogi)

Sök vidare utanför DiVA

GoogleGoogle Scholar
Totalt: 170 nedladdningar
Antalet nedladdningar är summan av nedladdningar för alla fulltexter. Det kan inkludera t.ex tidigare versioner som nu inte längre är tillgängliga.

urn-nbn

Altmetricpoäng

urn-nbn
Totalt: 89 träffar
RefereraExporteraLänk till posten
Permanent länk

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