Periodic Train Timetabling In Double-Way Railways By Considering The Praying Constraint

Please enable javascript in your browser.

Shekarchian, Sajjad | 2012

618 Viewed

Type of Document: M.Sc. Thesis
Language: Farsi
Document No: 43441 (01)
University: Sharif University of Technology
Department: Industrial Engineering
Advisor(s): Kianfar, Freydoon
Abstract:
Train timetabling is one of the most important problems in the railway scheduling field. It concerns with determining the trians’ arrival and departure times to/from each station so that some constraints are satisfied and some objectives are met. The objective in this thesis is to minimize the summation of dwell times of all trains. The timetables which are offered in this thesis are periodic. It means that each event repeats after a period time. The events are arrivals and departures of trains to/ from stations. In this timetable, the praying constraint is considered as wellso that after Azan time, the train has to dwell in the first station which has enough place for praying. So an integer programming model has been offered,but because of the problem complexity, model can not solve the real-scale problems. Thus two metaheuristic algorithms in the Simulated Anealing framework have been designed
Keywords:
Train Scheduling ; Double-Way Railways ; Periodic Events Scheduling Problem ; Praying Constraint ; Simulated Annealing Metaheuristic Algorithm

No TOC