SYNCHRONIZATION OF THE LAST-TRAIN TIMETABLE CONSIDERING PASSENGER TRANSFER TIME

Unsynchronized integrated lines in urban rail systems may cause some passengers to miss their last transfer chance. Therefore, passengers move faster in a swarm mentality to catch the last train. This study aims to synchronize the last-train timetable so that the maximum possible number of passengers can be transferred at the transfer stations by waiting for the minimum time. This paper provides a new approach to show that passengers who try to get to the last train at the transfer station move faster and describes the transfer processes with heuristic algorithms. In the case of the Istanbul urban rail system, passengers transfer to the last train 32% faster than average. To find the heuristic algorithm that defines the transfer processes of these passengers, particle swarm algorithms, dragonfly algorithms, and a simulated annealing algorithm were selected for comparison. The transfer times obtained with the particle swarm algorithm and the actual transfer times gave close results between 97.6% and 99.2%. The modified last-train timetable with predicted transfer time increases the number of successful transfers by 28%, decreasing the average waiting time of passengers from 197.27 seconds to 50.56 seconds. In addition, passengers wait 58 seconds less for the transfer to the last train by adjusting the timetable to the modified last train transfer time.

Authors

Publication Details

Journal
Transport Problems
Published
2024-12-01
DOI
https://doi.org/10.20858/tp.2024.19.4.17
Primary Topic
Railway Systems and Energy Efficiency
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

SYNCHRONIZATION OF THE LAST-TRAIN TIMETABLE CONSIDERING PASSENGER TRANSFER TIME

Zübeyde Öztürk, Taha Yüksel
Transport Problems
Railway Systems and Energy Efficiency
article

SYNCHRONIZATION OF THE LAST-TRAIN TIMETABLE CONSIDERING PASSENGER TRANSFER TIME

Zübeyde Öztürk, Taha Yüksel
article en

Abstract

Unsynchronized integrated lines in urban rail systems may cause some passengers to miss their last transfer chance. Therefore, passengers move faster in a swarm mentality to catch the last train. This study aims to synchronize the last-train timetable so that the maximum possible number of passengers can be transferred at the transfer stations by waiting for the minimum time. This paper provides a new approach to show that passengers who try to get to the last train at the transfer station move faster and describes the transfer processes with heuristic algorithms. In the case of the Istanbul urban rail system, passengers transfer to the last train 32% faster than average. To find the heuristic algorithm that defines the transfer processes of these passengers, particle swarm algorithms, dragonfly algorithms, and a simulated annealing algorithm were selected for comparison. The transfer times obtained with the particle swarm algorithm and the actual transfer times gave close results between 97.6% and 99.2%. The modified last-train timetable with predicted transfer time increases the number of successful transfers by 28%, decreasing the average waiting time of passengers from 197.27 seconds to 50.56 seconds. In addition, passengers wait 58 seconds less for the transfer to the last train by adjusting the timetable to the modified last train transfer time.

Transport ProblemsVol. 19(4)
Sustainable cities and communities
Openalex Percentile: Top 66%
Railway Systems and Energy Efficiency
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.