【摘要】 为了在非直达需求均能满足最少换乘的基础上进一步提高公交网络的直达率,建立了以直达率最大化和直达总时间最小化为目标的直达公交网络优化模型。与现有的研究相比,增加了换乘次数最小化约束,并采用具有遗传迭代机制的元启发式算法求解模型。利用Floyd算法求解初始网络最短路径,经线路删减、合并等操作后作为初始公交网络,使得模型具有高质量的初始解;通过space P法建模计算网络总换乘次数,在原有发车频率、最大车辆配备数、线路长度等约束下增加换乘次数最小化约束,采用频率共享规则进行客流分配,并与现有研究结果进行对比。结果表明,对于4条线路的Mandl’s Swiss网络,在不考虑发车频率优化时,直达率较现有研究的试验1、2、3分别提高9.7%、8.41%和0.39%。更多还原

【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.更多还原