一种公交最佳路径选择方法  

One way for optimal public traffic route choice

作　　者：杨峰[1] 纪凯 陈涛焘[3] 韩栋[1] 

机构地区：[1]中国矿业大学资源与安全工程学院,北京100083 [2]安徽省交通职业技术学院,合肥230051 [3]武汉理工大学交通学院,武汉430070

出　　处：《信息技术》2008年第2期67-70,共4页Information Technology

摘　　要：通过分析最短路径算法及城市公交网络的特点提出了城市公交网络换乘的实现方法。首先,针对城市公交网络构造公交网络模型。其次,根据城市公交网络特点引入公交网络的直达矩阵,并依据该直达矩阵将城市公交网络抽象表示成一个"公交网络邻接图"。再次,利用最短路径算法结合城市公交抽象网络图计算,得出最少换乘次数和可能的换乘站点。最后,利用所建立公交网络模型及所得换乘次数和可能的换乘站点进行计算,得到了综合考虑最小换乘和最短路径的最佳路径。并用一算例检验了该算法的有效性。This paper presents a way of public traffic arithmetic of shortest path and character of the city transfer in city public transfer network by analyzing the public traffic network system. Firstly, a public traffic network model is made on the basis of city public traffic system. Secondly, a through matrix of the public traffic network is introduced into the article, and transform the city public traffic network system into an abstract ＂public traffic network adjacent plot＂on the basis of the through matrix of the pubhc traffic network. Thirdly, the least transfer number and the possible transfer station are got using the shortest path algorithm and city public traffic network system abstract plot. Finally, the optimal result is got in consideration of the shortest transfer and the shortest path length problem by using the publict traffic network model and the possible transfer station. And then, a simple example is made which validate the feasibility of the algorithm in the city public traffic system network.

关 键 词：公交网络 最短路径 最小换乘 地理信息 网络分析 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]