| 一种改进的公交网络最优路径算法 |
| |
| 引用本文： | 商丽媛,张全信.一种改进的公交网络最优路径算法[J].数学的实践与认识,2009,39(1). |
| |
| 作者姓名： | 商丽媛 张全信 |
| |
| 作者单位： | 滨州学院,数学与信息科学系,山东,滨州,256600 |
| |
| 摘 要： | 通过对公交网络模型进行分析,考虑公交线路票价变化,按照出行时间最短同时保证换乘次数较少的原则,对现有解决公交网络最短路问题的算法进行改进.应用了将公交线路抽象为顶点,建立邻接矩阵的方法处理换乘问题.通过实际问题计算验证了算法的有效性.
|
| 关 键 词： | 公交网络 最优路径 公交换乘 邻接矩阵 |
A Improved Optimal Path Searching Algorithm in Transit Network |
| |
| SHANG Li-yuan,ZHANG Quan-xin.A Improved Optimal Path Searching Algorithm in Transit Network[J].Mathematics in Practice and Theory,2009,39(1). |
| |
| Authors: | SHANG Li-yuan ZHANG Quan-xin |
| |
| Abstract: | 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. |
| |
| Keywords: | transit network optimal path public traffic transfer Adjacency Matrix |
| 本文献已被 万方数据 等数据库收录！ |
|
