A practical model for transfer optimization in a transit network: Model formulations and solutions

This paper studies the transit network scheduling problem and aims to minimize the waiting time at transfer stations. First, the problem is formulated as a mixed integer programming model that gives the departure times of vehicles in lines so that passengers can transfer between lines at transfer stations with minimum waiting times. Then, the model is expanded to a second model by considering the extra stopping time of vehicles at transfer stations as a new variable set. By calculating the optimal values for these variables, transfers can be better performed. The sizes of the models, compared with the existing models, are small enough that the models can be solved for small- and medium-sized networks using regular MIP solvers, such as CPLEX. Moreover, a genetic algorithm approach is represented to more easily solve larger networks. A simple network is used to describe the models, and a medium-sized, real-life network is used to compare the proposed models with another existing model in the literature. The results demonstrate significant improvement. Finally, a large-scale, real-life network is used as a case study to evaluate the proposed models and the genetic algorithm approach