2018
DOI: 10.1155/2018/3835270
|View full text |Cite
|
Sign up to set email alerts
|

Transfer Coordination for Metro Networks during the Start- or End-of-Service Period

Abstract: When travelling via metro networks during the start-or end-of-service period, transferring passengers may suffer a transfer failure. Accordingly, the synchronization timetabling problem necessitates consideration of transfer waiting time and transfer availability with respect to the first or last train. Hence, transfer train index (TTI) is formulated to identify the transfer train and calculate the transfer waiting time. Furthermore, two types of connection indexes, the last connection train index (LCTI) and t… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2019
2019
2023
2023

Publication Types

Select...
6

Relationship

0
6

Authors

Journals

citations
Cited by 11 publications
(2 citation statements)
references
References 19 publications
0
2
0
Order By: Relevance
“…Thus, the authors implement metaheuristics, such as Multi-start Iterated Local Searches and Variable Neighborhood Searches. Indeed, the synchronization events between trips belonging to different planning periods are relevant as it is stated by the study of Ning et al [15] which addresses an optimization problem to reduce transfer waiting time and transfer availability with respect to the first or last train. Finally, Wu et al [16] enhance the problem of [1] to a biobjective version that optimizes the number of passengers benefited with synchronization and the deviation from an initial timetable.…”
Section: Related Literaturementioning
confidence: 99%
See 1 more Smart Citation
“…Thus, the authors implement metaheuristics, such as Multi-start Iterated Local Searches and Variable Neighborhood Searches. Indeed, the synchronization events between trips belonging to different planning periods are relevant as it is stated by the study of Ning et al [15] which addresses an optimization problem to reduce transfer waiting time and transfer availability with respect to the first or last train. Finally, Wu et al [16] enhance the problem of [1] to a biobjective version that optimizes the number of passengers benefited with synchronization and the deviation from an initial timetable.…”
Section: Related Literaturementioning
confidence: 99%
“…the rest of variables non-negative (18) Constraints (14) guarantee that the even headway for each line is bounded by the maximum headway time. Inequalities (15) and (16) bound the first departure time and the holding time at each stop by the even headway for each line, respectively. Finally, constraints (17) and (18) define the domain of the decision variables.…”
Section: Flmentioning
confidence: 99%