基于直达客流量的公交路径优化模型及求解算法

摘要

针对已有公交线路优化模型求解过程复杂的问题,从直达客流量的角度对公交最优路径进行求解.采用公交线路必经中间站点的选取方法,将最短路径KSP算法进行改进,用于求解最大直达客流量路径;以最大直达客流量、人均最小成本2个维度为优化目标,建立了基于网络人均出行成本最小的公交线路优化模型,并给出了模型求解的算法.实例证实,公交路径优化模型有效可行,降低了线路求解的难度.%In view of the complicated problems in the process of solving the optimization model of bus lines,the optimal path of the bus line is studied in term of direct passenger flow.The study shows that a bus line must pass through node selected model.KSP algorithm is improved for solving the direct flow viable of bus lines.Finally a minimum per capita travel cost bus route optimization model is established based on direct passenger volume and the average per capita minimum cost as the optimization goal.The algorithm for calculating the model is given.The model is verified by a practical example and the model reduces the difficulty of bus line optimization.