论文部分内容阅读
通过对公交网络模型进行分析,考虑公交线路票价变化,按照出行时间最短同时保证换乘次数较少的原则,对现有解决公交网络最短路问题的算法进行改进.应用了将公交线路抽象为顶点,建立邻接矩阵的方法处理换乘问题.通过实际问题计算验证了算法的有效性.
By analyzing the bus network model and considering the change of fare of bus routes, the algorithm of solving the shortest-path problem in public transport network is improved according to the principle of shortest travel time and fewer transfers, Vertices and adjacency matrices to deal with the transfer problem.The validity of the algorithm is verified by the actual problem calculation.