摘要
通过对公交网络模型进行分析,考虑公交线路票价变化,按照出行时间最短同时保证换乘次数较少的原则,对现有解决公交网络最短路问题的算法进行改进.应用了将公交线路抽象为顶点,建立邻接矩阵的方法处理换乘问题.通过实际问题计算验证了算法的有效性.
Through analyzing model of transit network, a new improved algorithm is proposed for optimal path. In the improved algorithm the changing price of public transportation line is considered. The route searching principle in the algorithm is the shortest travel time with the comparative least transfer times. A method is proposed for the problem of public traffic transfer. Public transit routes is abstracted as vertexes, and Adjacency Matrix is used in the method. A real example is computed to show the improved algorithm＇s efficiency.
出处
《数学的实践与认识》
CSCD
北大核心
2009年第1期167-171,共5页
Mathematics in Practice and Theory
关键词
公交网络
最优路径
公交换乘
邻接矩阵
transit network
optimal path
public traffic transfer
Adjacency Matrix
