Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Passenger-oriented Railway Traffic Re-scheduling: A Review of Alternative Strategies utilizing Passenger Flow Data
Blekinge Institute of Technology, Faculty of Computing, Department of Computer Science and Engineering.
Blekinge Institute of Technology, Faculty of Computing, Department of Computer Science and Engineering.
2017 (English)Conference paper, Published paper (Refereed)
Abstract [en]

Developing and operating seamless, attractive and efficient public transport services in a liberalized market requires significant coordination between involved actors, which is both an organizational and technical challenge. During a journey, passengers often transfer between different transport services. A delay of one train or a bus service can potentially cause the passenger to miss the transfer to the subsequent service. If those services are provided by different operators and those are not coordinated and the information about the services are scattered, the passengers will suffer. In order to incorporate the passenger perspective in the re-scheduling of railway traffic and associated public transport services, the passenger flow needs to be assessed and quantified. We therefore perform a survey of previous research studies that propose and apply computational re-scheduling support for railway traffic disturbance management with a passenger-oriented objective. The analysis shows that there are many different ways to represent and quantify the effects of delays on passengers, i.e.“passenger inconvenience”. In the majority of the studies, re-scheduling approaches rely on historic data on aggregated passenger flows, which are independent of how the public transport services are re-scheduled. Few studies incorporate a dynamic passenger flow model that reacts based on how the transport services are re-scheduled. None of the reviewed studies use real-time passenger flow data in the decision-making process. Good estimations of the passenger flows based on historic data are argued to be sufficient since access to large amounts of passenger flow data and accurate prediction models is available today.

Place, publisher, year, edition, pages
2017.
Keywords [en]
Train re-scheduling, Passenger satisfaction, Passenger flow dynamics, Delay management
National Category
Infrastructure Engineering Computer Sciences
Identifiers
URN: urn:nbn:se:bth-14114OAI: oai:DiVA.org:bth-14114DiVA, id: diva2:1089297
Conference
7th International Conference on Railway Operations Modelling and Analysis, Lille
Projects
TRANS-FORMFLOATAvailable from: 2017-04-19 Created: 2017-04-19 Last updated: 2019-08-15Bibliographically approved
In thesis
1. Parallel algorithms for real-time railway rescheduling
Open this publication in new window or tab >>Parallel algorithms for real-time railway rescheduling
2019 (English)Licentiate thesis, comprehensive summary (Other academic)
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.

Place, publisher, year, edition, pages
Sweden: Blekinge Institute of Technology, 2019. p. 184
Series
Blekinge Institute of Technology Licentiate Dissertation Series, ISSN 1650-2140 ; 9
National Category
Computer Sciences
Identifiers
urn:nbn:se:bth-18511 (URN)978-91-7295-378-9 (ISBN)
Presentation
2019-09-09, J1640, Campus Gräsvik, Karlskrona, 13:00 (English)
Opponent
Supervisors
Available from: 2019-08-02 Created: 2019-08-02 Last updated: 2019-08-19Bibliographically approved

Open Access in DiVA

fulltext(489 kB)171 downloads
File information
File name FULLTEXT01.pdfFile size 489 kBChecksum SHA-512
d1bed54b30033f9a7c23e1cc92036f46a64aa3ec9ea717b9940b509bf26b603e61a66c53a9b1b5752431afb63b3396e4ec7d5e52d9bcdd1e5b7d9d3ee95372ec
Type fulltextMimetype application/pdf

Authority records BETA

Josyula, Sai PrashanthTörnquist Krasemann, Johanna

Search in DiVA

By author/editor
Josyula, Sai PrashanthTörnquist Krasemann, Johanna
By organisation
Department of Computer Science and Engineering
Infrastructure EngineeringComputer Sciences

Search outside of DiVA

GoogleGoogle Scholar
Total: 171 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

urn-nbn

Altmetric score

urn-nbn
Total: 628 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf