新型公交网络模型与最优出行路径算法  

The New Model of the Transit Network and the Algorithm of Optimal Travelling Path

作　　者：张军芳[1] 徐勇[1] 何文杰[1] 

机构地区：[1]河北工业大学理学院,天津300401

出　　处：《复杂系统与复杂性科学》2009年第4期71-75,共5页Complex Systems and Complexity Science

基　　金：国家自然科学基金(10871058);河北省自然科学基金(F2008000117)

摘　　要：给出一种标号的二分图公交网络模型,在此模型基础上给出线路换乘与最优出行路径的算法,这种算法充分利用标号信息给出站点网络图的边权函数。基于站点网络图不仅能够搜索换乘线路而且能够找到最短路径。最后利用天津市部分公交系统验证了该模型及方法的有效性。A transit network model of signed bipartite graph is given, on the basis of this model and its station network graph the bus transfer and the algorithm of the optimal traveling are given, the edgeweight function of the station network graph is given by this algorithm which fully uses the signed information. On the basis of the station network graph bus transfer is not only given but the shortest route can be found. Finally the part bus system of Tianjin which signed is taken for example to show the effectiveness of transfer and the optimal routes of the traveling.

关 键 词：标有站牌号的二分图模型 公交站点网络图 最佳出行路径 

分 类 号：N94[自然科学总论—系统科学] U12[交通运输工程]