2014
DOI: 10.1016/j.trb.2014.05.005
|View full text |Cite
|
Sign up to set email alerts
|

Simultaneous train rerouting and rescheduling on an N-track network: A model reformulation with network-based cumulative flow variables

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

2
123
0
6

Year Published

2015
2015
2022
2022

Publication Types

Select...
5
5

Relationship

0
10

Authors

Journals

citations
Cited by 242 publications
(131 citation statements)
references
References 35 publications
2
123
0
6
Order By: Relevance
“…As stated by Meng and Zhou [33], to improve the competitive advantages of rail operators, providing punctual and reliable train services is a fundamental goal. A train schedule typically contains detailed departure times, arrival times, train orders, and train circulation plan for each train service in the urban rail transit line.…”
Section: Optimal Train Scheduling Problemmentioning
confidence: 99%
“…As stated by Meng and Zhou [33], to improve the competitive advantages of rail operators, providing punctual and reliable train services is a fundamental goal. A train schedule typically contains detailed departure times, arrival times, train orders, and train circulation plan for each train service in the urban rail transit line.…”
Section: Optimal Train Scheduling Problemmentioning
confidence: 99%
“…In [9]have formulated a new technique to obtain an efficient decomposition mechanism through modelling track capacities as side constraints using IP model. These side constraints are then dualised through a new Lagrangianrelaxation solution technique.…”
Section: Several Model Approaches For Rescheduling Have Been Proposedmentioning
confidence: 99%
“…This problem has been shown to be NP-hard even in the feasibility case ( Remarkable improvements with respect to the current practice and/or to the basic dispatching rules adopted in most practical applications are reported in these papers. Other approaches to TS based on Mixed Integer Linear Programs (MILPs) are reported, e.g., in Törnquist Krasemann (2011), Lamorgese and Mannino (2014), Meng and Zhou (2014), Pellegrini et al (2014). The goal of all these approaches is to find a train schedule, i.e., a departure/passing time for each train et each relevant point of the railway network, compatible with the real time position of each train and such that a suitable function of the train delays is minimized.…”
Section: Train Schedulingmentioning
confidence: 99%