Record Details

Modelling disruptions and resolving conflicts optimally in a railway schedule

DSpace at IIT Bombay

View Archive Info
 
 
Field Value
 
Title Modelling disruptions and resolving conflicts optimally in a railway schedule
 
Creator NARAYANASWAMI, S
RANGARAJ, N
 
Subject Disruption
Conflicts
Optimal resolution
Single-track railway
Mixed-integer linear programming
REAL-TIME
TRANSPORTATION
TRAINS
 
Description 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 nonconflicting 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. (C) 2012 Elsevier Ltd. All rights reserved.
 
Publisher PERGAMON-ELSEVIER SCIENCE LTD
 
Date 2014-10-15T14:16:07Z
2014-10-15T14:16:07Z
2013
 
Type Article
 
Identifier COMPUTERS & INDUSTRIAL ENGINEERING, 64(1)469-481
http://dx.doi.org/10.1016/j.cie.2012.08.004
http://dspace.library.iitb.ac.in/jspui/handle/100/15079
 
Language en