Real-time high-speed train rescheduling in case of a complete blockage

Shou-yi, Zhan; Kroon, Leo; Veelenturf, Lucas P.; Wagenaar, Joris

doi:10.1016/j.trb.2015.04.001

Cited by 145 publications

(73 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…The model is tested on a part of the Dutch railway network, and in most cases the computational time is acceptable. Zhan et al (2015) consider railway rescheduling on a high-speed line in case of a complete blockage. Due to the nature of the seat reservations, trains that have started their journey have to end in their final destination and cannot be rerouted or cancelled.…”

Section: Literature Reviewmentioning

confidence: 99%

The multi-objective railway timetable rescheduling problem

Binder

Maknoon

Bierlaire

2017

Transportation Research Part C: Emerging Technologies

148

View full text Add to dashboard Cite

Section: Literature Reviewmentioning

confidence: 99%

The multi-objective railway timetable rescheduling problem

Binder

Maknoon

Bierlaire

2017

Transportation Research Part C: Emerging Technologies

148

View full text Add to dashboard Cite

“…The implementation of short-turning trains still needs to be investigated more at a microscopic level of detail. Zhan et al (2015) Adjusting contingency plan, discussing decision Nakamura et al (2011) Chu and Oetting (2013) Veelenturf et al (2016) Another problem in the first phase is how to adjust a contingency plan and reach an agreement on a decision. To address this problem, the papers on rescheduling that include cancelling and short-turning trains can be used.…”

Section: First Phasementioning

confidence: 99%

“…Hirai et al (2009) provide a model that can be used to calculate the stop positions for the trains that are affected directly so that the other trains could continue their trips conflict-free. The approach by Zhan et al (2015) also defines the waiting location for trains until the source of the disruption is over. We believe that using a decision support tool can speed up the process of discussion and decision making.…”

Section: First Phasementioning

confidence: 99%

Railway disruption management challenges and possible solution directions

Ghaemi

Cats

2017

Public Transp

View full text Add to dashboard Cite

This paper investigates the challenges of railway traffic controllers in dealing with big disruptions and the kind of support tools that could help to improve their task in terms of performance, lead time and workload. The disruption handling process can be partitioned into three phases resembling a bathtub. For each phase the essential decision making process has been identified. Currently, the support to rail traffic controllers in case of severe disruptions is limited to predefined contingency plans that are not always feasible or applicable. In the literature, models and algorithms have been identified that could be used in the different parts of the three phases of the disruption handling process. This paper investigates the processes of disruption management in practice and the challenges that traffic controllers are facing during a disruption. The literature of models applicable to disruption management is reviewed and classified based on the three phases of the traffic state during disruptions. Finally, a rescheduling optimization model is applied to a case of complete blockage on a corridor of the Dutch railway network. The case study shows how a microscopic model could support the traffic controllers by providing real-time solutions for different phases of a disruption.

show abstract

“…Rescheduling (recovery) on the above three stages is also important for realtime disturbance and disruption management. Examples of railway rescheduling include AdensoDíaz et al (1999);Huisman (2007); Tornquist and Persson (2007); Burdett and Kozan (2009) ;Kroon et al (2015); Kang et al (2015); Zhan et al (2015); Meng and Zhou (2011). See a survey on railway rescheduling in Cacchiani et al (2014).…”

Section: Literature Reviewmentioning

confidence: 99%

A branch-and-price approach for solving the train unit scheduling problem

Lin

Kwan

2016

Transportation Research Part B: Methodological

View full text Add to dashboard Cite

We propose a branch-and-price approach for solving the integer multicommodity flow model for the network-level train unit scheduling problem (TUSP). Given a train operator's fixed timetable and a fleet of train units of different types, the TUSP aims at determining an assignment plan such that each train trip in the timetable is appropriately covered by a single or coupled train units. The TUSP is challenging due to its complex nature. Our branch-and-price approach includes a branching system with multiple branching rules for satisfying real-world requirements that are difficult to realize by linear constraints, such as unit type coupling compatibility relations and locations banned for coupling/decoupling. The approach also benefits from an adaptive node selection method, a column inheritance strategy and a feature of estimated upper bounds with node reservation functions. The branch-and-price solver designed for TUSP is capable of handling instances of up to about 500 train trips. Computational experiments were conducted based on real-world problem instances from First ScotRail. The results are satisfied by rail practitioners and are generally competitive or better than the manual ones.

show abstract

Real-time high-speed train rescheduling in case of a complete blockage

Cited by 145 publications

References 19 publications

The multi-objective railway timetable rescheduling problem

The multi-objective railway timetable rescheduling problem

Railway disruption management challenges and possible solution directions

A branch-and-price approach for solving the train unit scheduling problem

Contact Info

Product

Resources

About