Double-Track Train Scheduling Problem to Optimize Rail Line Utilization

Document Type : Scientific - Research

Authors

Abstract

In this study, the train scheduling problem in double track railway lines with makespan criteria is investigated. In order to maximize the use of railway capacity, trains should be scheduled as close as possible, subject to safety and operational constraints. An integer programming model is presented for maximize the use of existing capacity of a railway line. The main decision variables are the sequence of dispatches from origin station, headway time between successive trains, assignment of trains to tracks in stations and stop schedule for praying services in order to minimize the makespan criteria. Trains travel the railway line in the same direction with no permission to overtake. Stopping schedule of trains for performing praying services is unknown and should be determined as decision variables, but other services such as passenger load and unloading, refueling and water supplying are predetermined operations. The capacity of station is considered by the number of tracks and platforms existed for stop and pass of trains in the mathematical model. Some valid inequalities are developed to decrease the computational time. The performance of the integer programming model is tested on small, medium and large size randomly generated problems and two real cases of IRAN railway network. The output results show the effectiveness of the proposed valid inequality in reducing the CPU time for solving the small and medium size problems by CPLEX. The CPLEX can also solve the real size problems in reasonable time when the sequence of dispatch is known.
 

Keywords

Files

History

  • Receive Date: 24 August 2013
  • Accept Date: 10 December 2013

Share

How to cite

Statistics