Endre søk
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • 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
Exploring the Potential of GPU Computing in Train Rescheduling
Blekinge Tekniska Högskola, Fakulteten för datavetenskaper, Institutionen för datavetenskap.
Blekinge Tekniska Högskola, Fakulteten för datavetenskaper, Institutionen för datavetenskap.
Blekinge Tekniska Högskola, Fakulteten för datavetenskaper, Institutionen för datavetenskap.
2019 (engelsk)Inngår i: Proceedings of the 8th International Conference on Railway Operations Modelling and Analysis, Norrköping, 2019., 2019Konferansepaper, Publicerat paper (Fagfellevurdert)
sted, utgiver, år, opplag, sider
2019.
HSV kategori
Identifikatorer
URN: urn:nbn:se:bth-18510OAI: oai:DiVA.org:bth-18510DiVA, id: diva2:1340179
Konferanse
8th International Conference on Railway Operations Modelling and Analysis
Tilgjengelig fra: 2019-08-02 Laget: 2019-08-02 Sist oppdatert: 2019-08-15bibliografisk kontrollert
Inngår i avhandling
1. Parallel algorithms for real-time railway rescheduling
Åpne denne publikasjonen i ny fane eller vindu >>Parallel algorithms for real-time railway rescheduling
2019 (engelsk)Licentiatavhandling, med artikler (Annet vitenskapelig)
Abstract [en]

In railway traffic systems, it is essential to achieve a high punctuality to satisfy the goals of the involved stakeholders. Thus, whenever disturbances occur, it is important to effectively reschedule trains while considering the perspectives of various stakeholders. The train rescheduling problem is a complex task to solve, both from a practical and a computational perspective. From the latter perspective, a reason for the complexity is that the rescheduling solution(s) of interest may be dispersed across a large solution space. This space needs to be navigated fast while avoiding portions leading to undesirable solutions and exploring portions leading to potentially desirable solutions. The use of parallel computing enables such a fast navigation of the search tree. Though competitive algorithmic approaches for train rescheduling are a widespread topic of research, limited research has been conducted to explore the opportunities and challenges in parallelizing them.

This thesis presents research studies on how trains can be effectively rescheduled while considering the perspectives of passengers along with that of other stakeholders. Parallel computing is employed, with the aim of advancing knowledge about parallel algorithms for solving the problem under consideration.

The presented research contributes with parallel algorithms that reschedule a train timetable during disturbances and studies the incorporation of passenger perspectives during rescheduling. Results show that the use of parallel algorithms for train rescheduling improves the speed of solution space navigation and the quality of the obtained solution(s) within the computational time limit.

This thesis consists of an introduction and overview of the work, followed by four research papers which present: (1) A literature review of studies that propose and apply computational support for train rescheduling with a passenger-oriented objective; (2) A parallel heuristic algorithm to solve the train rescheduling problem on a multi-core parallel architecture; (3) A conflict detection module for train rescheduling, which performs its computations on a graphics processing unit; and (4) A redesigned parallel algorithm that considers multiple objectives while rescheduling.

sted, utgiver, år, opplag, sider
Sweden: Blekinge Institute of Technology, 2019. s. 184
Serie
Blekinge Institute of Technology Licentiate Dissertation Series, ISSN 1650-2140 ; 9
HSV kategori
Identifikatorer
urn:nbn:se:bth-18511 (URN)978-91-7295-378-9 (ISBN)
Presentation
2019-10-17, J1640, Campus Gräsvik, Karlskrona, 09:00 (engelsk)
Opponent
Veileder
Tilgjengelig fra: 2019-08-02 Laget: 2019-08-02 Sist oppdatert: 2019-09-17bibliografisk kontrollert

Open Access i DiVA

fulltext(2188 kB)41 nedlastinger
Filinformasjon
Fil FULLTEXT01.pdfFilstørrelse 2188 kBChecksum SHA-512
c40242731236fe9cb60e72eb1cd0ecba3986da1ebd5a1df362381bcfac563b351d4fa921c0540a189ba4e195522649889675e75b94b48cee2a14d89884b95c36
Type fulltextMimetype application/pdf

Personposter BETA

Josyula, Sai PrashanthTörnquist Krasemann, JohannaLundberg, Lars

Søk i DiVA

Av forfatter/redaktør
Josyula, Sai PrashanthTörnquist Krasemann, JohannaLundberg, Lars
Av organisasjonen

Søk utenfor DiVA

GoogleGoogle Scholar
Totalt: 41 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: 244 treff
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • 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