A fast heuristic for the train scheduling problem
Computers and Operations Research
Hybrid simulation for resolving resource conflict in train traffic rescheduling
Computers in Industry
A Survey of Optimization Models for Train Routing and Scheduling
Transportation Science
Simultaneous disruption recovery of a train timetable and crew roster in real time
Computers and Operations Research
From timetabling to train regulation-a new train operation model
Information and Software Technology
An object-oriented, constraint-based heuristic for a class ofpassenger-train scheduling problems
IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews
Computers and Industrial Engineering
| Hi-index | 0.00 |
Resolving disruptions, by dispatching and rescheduling conflicting trains is an NP-complete problem. Earlier literature classify railway operations as: (i) tactical scheduling, (ii) operational scheduling, and (iii) rescheduling. We distinguish the three based on operational criticality. Existing optimisation models do not distinguish precisely between scheduling and rescheduling based on constraints modelling; the only difference is in their objective function. Our model is the first of its kind to incorporate disruptions in an MILP model and to include conflicts-resolving constraints in the model itself. The major advantage of such a formulation is that only those trains which are disrupted are rescheduled and other non-conflicting trains retain their original schedules. Our model reschedules disrupted train movements on both directions of a single track layout with an objective to minimise total delay of all trains at their destinations. Using a small sized data it is proved that all possible conflicts out of a disruption are resolved. Apart from achieving optimal resolutions, we infer through experimental verification that a non-standard dispatch ordering is a requisite for global optimality, as cogitated by other authors.