A Railway Timetable Rescheduling Approach for Handling Large-Scale Disruptions

Veelenturf, Lucas P.; Kidd, Martin Philip; Cacchiani, Valentina; Kroon, Leo; Toth, Paolo

doi:10.1287/trsc.2015.0618

Cited by 151 publications

(84 citation statements)

References 36 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…IP-based railway capacity management model was also presented by [6] with the objective of minimizing the sum of total travel time and delay for trains, utilizing rail track capacity through efficient routing and scheduling. Other IP models are established by [7][8] which determine a timetable for a set of trains, subject to some operational constraints within the track capacities, while minimizing the number of cancelled and delayed trains.…”

Section: Several Model Approaches For Rescheduling Have Been Proposedmentioning

confidence: 99%

“…In addition to this, Constraint (7) specifies that trains should strictly depart and arrive according to the planned scheduled as soon as it has completed the minimum running time Δ k . Constraint (8) indicates that the rescheduled departure time should never be earlier than the original time scheduled. The earliest it can depart is at least equivalent to the respective scheduled departure time of that event at station.…”

Section: The Optimization Modelmentioning

confidence: 99%

See 1 more Smart Citation

Priority based technique for rescheduling trains

Alwadood

Shuib

Hamid

2018

J. Fundam and Appl Sci.

View full text Add to dashboard Cite

This paper presents a novel approach to solve a railway rescheduling problem using a Mixed Integer Goal Programming (MIGP) model rescheduling timetable based on train priorities whenever a service disruption occurs. The objectives are to minimize the total delay time of all trains in the rail line and maximize the service reliability. The experiments were done on Malaysian double track railway system and the model was solved using a heuristics approach great influence on the total delay time and service reliability. This r more advanced and practical model as it is able to produce the provisional timetable in short computing time and the solution generated satisfies all the restrictions posed by the rail operator. This paper presents a novel approach to solve a railway rescheduling problem using a Mixed KeywordsProgramming (MIGP) model. The model is developed to find a new rescheduling timetable based on train priorities whenever a service disruption occurs. The objectives are to minimize the total delay time of all trains in the rail line and maximize the service reliability. The experiments were done on Malaysian double track railway system and the model was solved using a heuristics approach. The result shows that train priority has a great influence on the total delay time and service reliability. This research has proposed a more advanced and practical model as it is able to produce the provisional timetable in short computing time and the solution generated satisfies all the restrictions posed by the rail rescheduling; mathematical modelling; service disruptions; priority.

show abstract

Section: Several Model Approaches For Rescheduling Have Been Proposedmentioning

confidence: 99%

Section: The Optimization Modelmentioning

confidence: 99%

Priority based technique for rescheduling trains

Alwadood

Shuib

Hamid

2018

J. Fundam and Appl Sci.

View full text Add to dashboard Cite

show abstract

“…The replanning of a timetable or operative train plan due to track closures (complete or partial) or maintenance activities have been studied in: Brucker et al (2005) (scheduling of single track traffic past a working site on a line section); Vansteenwegen et al (2015) (robust rescheduling due to planned track closures on large stations and junctions); and Veelenturf et al (2015) and Louwerse and Huisman (2014) (rescheduling of timetables, rolling stock and crew during major disruptions in operational dispatching). In all these cases the track closures are given as fixed input.…”

Section: Train Scheduling and Operationsmentioning

confidence: 99%

An optimization model for integrated planning of railway traffic and network maintenance

Lidén

Joborn

2017

Transportation Research Part C: Emerging Technologies

View full text Add to dashboard Cite

Railway transportation systems are important for society and have many challenging and important planning problems. Train services as well as maintenance of a railway network need to be scheduled efficiently, but have mostly been treated as two separate planning problems. Since these activities are mutually exclusive they must be coordinated and should ideally be planned together. In this paper we present a mixed integer programming model for solving an integrated railway traffic and network maintenance problem. The aim is to find a long term tactical plan that optimally schedules train free windows sufficient for a given volume of regular maintenance together with the wanted train traffic. A spatial and temporal aggregation is used for controlling the available network capacity. The properties of the proposed model are analysed and computational experiments on various synthetic problem instances are reported. Model extensions and possible modifications are discussed as well as future research directions.

show abstract

“…The rst one (B.S.T.1) is developed by Sha a et al [29], whereas the latter (B.S.T.2) is the heuristic one, proposed in this work.…”

Section: Heuristic Beam Search Techniquementioning

confidence: 99%

“…They proposed a mixed integer linear programming problem with minimising energy consumption as the objective function considered. Veelenturf et al [29] focused on timetable rescheduling for passenger trains. They formulated an integer programming model, which minimizes the number of cancelled and delayed trains while adhering to infrastructure and rolling stock capacity constraints.…”

Section: Introductionmentioning

confidence: 99%

Simultaneous Train Rescheduling through Cancelling, Delaying and Re-Ordering Policies: Three-Phase Solution Method with Guaranteed Optimality

Tamannaei¹,

Saffarzadeh

Jamili

et al. 2017

Scientia Iranica

View full text Add to dashboard Cite

Abstract. In this article, a new approach is presented to solve the double-track railway rescheduling problem, when an incident occurs into one of the block sections of the railway. The approach simultaneously considers three rescheduling policies: cancelling, delaying, and reordering. To nd the optimal con ict-free timetables compatible with the approach, a mathematical model and an exact three-phase solution method are proposed. The method is based on Branch-and-Bound (B&B) algorithm. The lower bound consists of two cost parts: the cost of deviation from the primary timetable and the cost of train cancellation. To generate an appropriate upper bound, the method exploits an innovative algorithm called \Local Left Shifting". A heuristic beam search technique is also developed for tackling the large-scale problems. An experimental analysis on two double-track railways of the Iranian network indicates that the proposed solution method provides the optimal solution in much shorter time, compared with the time taken to solve the mathematical model by CPLEX software. Based on the ndings of this research, it is possible to optimally retrieve the primary timetable after incident occurrence during a pre-determined time horizon.

show abstract

A Railway Timetable Rescheduling Approach for Handling Large-Scale Disruptions

Cited by 151 publications

References 36 publications

Priority based technique for rescheduling trains

Priority based technique for rescheduling trains

An optimization model for integrated planning of railway traffic and network maintenance

Simultaneous Train Rescheduling through Cancelling, Delaying and Re-Ordering Policies: Three-Phase Solution Method with Guaranteed Optimality

Contact Info

Product

Resources

About