A practical model for last train rescheduling with train delay in urban railway transit networks

Kang, Liujiang; Wu, Jianjun; Sun, Huijun; Zhu, Xiaomin; Wang, Bo

doi:10.1016/j.omega.2014.07.005

Cited by 133 publications

(68 citation statements)

References 32 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In this regard, a high-efficiency algorithm is worthy of studying to solve this rescheduling problem. Kang et al [19] and Xu, Zhao, and Ning [20] proposed a last train rescheduling model allowing for a last train delay and developed the genetic algorithm which can generate the last train timetable quickly.…”

Section: Literature Reviewmentioning

confidence: 99%

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

Ning

Zhao

et al. 2018

Mathematical Problems in Engineering

View full text Add to dashboard Cite

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 the first connection train index (FCTI), are devised to distinguish transfer failure from transfer success, and the penalty constraints are implemented together to reflect the adverse effects of transfer failure. Then, a mixed integer programming model is developed to concurrently reduce transfer waiting time and improve transfer availability, which can be solved by CPLEX. Finally, a case study on Beijing metro network is made to verify the method. Experimental results show that our proposed model can yield synchronization solutions with significant reductions in both the average transfer waiting time and the proportion of transfer failure passengers.

show abstract

Section: Literature Reviewmentioning

confidence: 99%

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

Ning

Zhao

et al. 2018

Mathematical Problems in Engineering

View full text Add to dashboard Cite

show abstract

“…Zhou et al [9] built coordination optimization models of the last trains' departure time to reduce passengers' transfer waiting time for the last trains and inaccessible passenger volume of all origin-destination (OD) and improve passengers' accessible reliability for the last trains. Kang et al [10] proposed a rescheduling model for last trains with the consideration of train delays caused by incidents that occurred in train operations. Kang et al [11] established a lasttrain network transfer model to maximize passenger transfer connection headway, which reflected last-train connections and transfer waiting time.…”

Section: Literature Reviewmentioning

confidence: 99%

Last-Train Timetabling under Transfer Demand Uncertainty: Mean-Variance Model and Heuristic Solution

Yang

Gao

et al. 2017

Journal of Advanced Transportation

View full text Add to dashboard Cite

Traditional models of timetable generation for last trains do not account for the fact that decision-maker (DM) often incorporates transfer demand variability within his/her decision-making process. This study aims to develop such a model with particular consideration of the decision-makers' risk preferences in subway systems under uncertainty. First, we formulate an optimization model for last-train timetabling based on mean-variance (MV) theory that explicitly considers two significant factors including the number of successful transfer passengers and the running time of last trains. Then, we add the mean-variance risk measure into the model to generate timetables by adjusting the last trains' departure times and running times for each line. Furthermore, we normalize two heterogeneous terms of the risk measure to provide assistance in getting reasonable results. Due to the complexity of MV model, we design a tabu search (TS) algorithm with specifically designed operators to solve the proposed timetabling problem. Through computational experiments involving the Beijing subway system, we demonstrate the computational efficiency of the proposed MV model and the heuristic approach.

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

A practical model for last train rescheduling with train delay in urban railway transit networks

Cited by 133 publications

References 32 publications

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

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

Last-Train Timetabling under Transfer Demand Uncertainty: Mean-Variance Model and Heuristic Solution

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

Contact Info

Product

Resources

About