Coordinated Scheduling in Public Transportation by Aim of Transfer Time Reduce

Please enable javascript in your browser.

Khani, Alireza |

425 Viewed

Type of Document: M.Sc. Thesis
Language: Farsi
Document No: 39088 (09)
University: Sharif University of Technology
Department: Civil Engineering
Advisor(s): Shafahi, Yusof
Abstract:
The thesis is about transit network scheduling problem and aims to minimize waiting time at transfer stations. The problem is formulated as a mixed integer programing model that gives departure times of vehicles in lines so that passengers can transfer between lines at transfer stations with minimum waiting time. The model is expanded to another model by considering an extra stoping time of vehicles at transfer stations as a new variable set. By calculationg the optimal value for these variables, transfers could be done in a better condition. The sizes of the models are small enough that the models can be solved for small and medium size networks using regular MIP solvers. Moreover, a Genetic Algorithm approach is represented to solve larger networks easier. A simple network is used to describe the models and a medium size, real-life network is used to compare the proposed models with an existing model in the literature. Results demonstrate significant improvement. Also a large-scale, real-life network is used as a case study to evaluate the proposed models and the Genetic Algorithm approach
Keywords:
Coordinated Transit Scheduling ; Transit

No TOC