Train Scheduling on a two-Way and Single Track Railway Line Considering the Train Stops for Prayer

Please enable javascript in your browser.

Tahernejad, Sahar | 2012

518 Viewed

Type of Document: M.Sc. Thesis
Language: Farsi
Document No: 44390 (01)
University: Sharif University of Technology
Department: Industrial Engineering
Advisor(s): Salmasi, Naser
Abstract:
Train scheduling is one of the most complicated stages of railway planning. In this stage, the arrival and departure times of trains at stations are determined. In this thesis, we studied train scheduling on a two-way and single track railway in order to minimize the total travel times of trains subject to a set of operational constraints and prayer time related constraints that determines the optimal station for prayer. In this project, we tried to simulate the real constraints exist in IRAN railway network and the objective function considers customer’s and railway management’s satisfaction, simultaneously. First, a mathematical programming is proposed for this problem. After demonstrating that the problem is NP-hard, a tabu search algorithm is designed for solving large problems. Tabu search algorithm determines the sequence of trains on the blocks and CPLEX software presents the optimal scheduling of this sequence. The results show that the algorithm is efficient for real-world instances
Keywords:
Scheduling ; Train ; Praying Constraint ; Train Scheduling ; Single Track Railway Line ; Two-Way Railway Line ; Tabu Search Algorithm

No TOC