2020
DOI: 10.1155/2020/5609524
|View full text |Cite
|
Sign up to set email alerts
|

A Fast Approach for Reoptimization of Railway Train Platforming in Case of Train Delays

Abstract: Train platforming is critical for ensuring the safety and efficiency of train operations within the stations, especially when unexpected train delays occur. This paper studies the problem of reoptimization of train platforming in case of train delays, where the train station is modeled using the discretization of the platform track time-space resources. To solve the reoptimization problem, we propose a mixed integer linear programming (MILP) model, which minimizes the weighted sum of total train delays and the… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
9
0
1

Year Published

2020
2020
2024
2024

Publication Types

Select...
4
2

Relationship

1
5

Authors

Journals

citations
Cited by 12 publications
(10 citation statements)
references
References 48 publications
0
9
0
1
Order By: Relevance
“…Method extensions and practical applications were also discussed. In addition, evaluation work can be further combined with other transportation organization or disruption management research to formulate collaborative optimization strategies, such as robust train timetabling [57], train platforming [58], rolling stock scheduling [59], and energy saving [60]. e method of parameter estimation needs to be improved.…”
Section: Discussionmentioning
confidence: 99%
“…Method extensions and practical applications were also discussed. In addition, evaluation work can be further combined with other transportation organization or disruption management research to formulate collaborative optimization strategies, such as robust train timetabling [57], train platforming [58], rolling stock scheduling [59], and energy saving [60]. e method of parameter estimation needs to be improved.…”
Section: Discussionmentioning
confidence: 99%
“…(16) D i s (2) i = s (1) i+1 , s (2) i+1 , s (3) i+1 (17) D i s (3) i = s (3) i+1 , s (4) i+1 (18) i+1 = D i s (1) i ∪ D i s (1) i ∪ D i s (2) i = s (1) i+1 , s (2) i+1 , s (3) i+1 , s (4) i+1 (19)…”
Section: I+1unclassified
“…M. Wang et al [18] developed a genetic algorithm based on the particle swarm optimization (PSO) to solve the TRP under primary delays. Y. Zhang et al [19] studied the problem of re-optimization of train platform in case of train delays, where the station is modeled using the discretization of the platform track time-space resources. In addition, for solving the MILP model, an efficient heuristic algorithm is designed to speed up the re-optimization process with good solution precision.…”
Section: Introductionmentioning
confidence: 99%
“…Zhang et al. (2020) proposed a mixed integer linear programming model, which minimized the weighted sum of total train delays and the platform track assignment costs, subject to constraints defined by operational requirements [52].…”
Section: Related Workmentioning
confidence: 99%
“…Vansteenwegen et al (2019) proposed a conflict prevention strategy for large and complex networks in real-time railway traffic management based on the analysis of the impact of the unexpected events such as overcrowded platforms or small mechanical defects can cause conflicts [51]. Zhang et al (2020) proposed a mixed integer linear programming model, which minimized the weighted sum of total train delays and the platform track assignment costs, subject to constraints defined by operational requirements [52].…”
Section: Related Workmentioning
confidence: 99%