Industrial Engineering Journal ›› 2020, Vol. 23 ›› Issue (6): 117-123.doi: 10.3969/j.issn.1007-7375.2020.06.016

• practice & application • Previous Articles     Next Articles

A Direct Optimization in Urban Transit Network for Small and Medium-sized Cities

CAO Zhenyu1,2, JIANG Yangsheng1,2, LUO Xiaoling1,2, YANG Jie1,2, ZHANG Yao1,2   

  1. 1. School of Transportation and Logistics;
    2. National Engineering Laboratory of Integrated Transportation Big Data Application Technology, Southwest Jiaotong University, Chengdu 610031, China
  • Received:2019-08-29 Published:2020-12-18

Abstract: To improve the direct rate of transit network on the basis of transfer demand satisfied with the least transfer, a direct transit network optimization model with the goal of maximizing the direct rate and minimizing the total direct time was designed. Minimizing transfer times was discussed as constraint in the model compared with the existing research, and meta-heuristics algorithm that utilizes main operators similar to GA was applied for solutions. Floyd algorithm was used to find the shortest path of the initial transit network as initial transit network by decreasing routes or combining routes, so that the model obtained initial solution of high quality. Total transfer times of transit network was calculated by space P method, and minimizing transfer times was taken into account under the existing constraint conditions that contains frequencies, fleet size available, length of transit routes, and so forth, and then the demand was distributed to routes using frequency share rule. Comparing with the existing research results, the results show that the direct rate increases by 9.7%, 8.41% and 0.39% in the Mandall's Swiss network of four routes, compared with the experiment 1, 2 and 3 of the existing research without considering the optimization of frequencies.

Key words: transit network optimization, direct transit network, meta-heuristics algorithm, minimizing transfer times constraint, initial transit network

CLC Number: