一种基于公交路线的规划方法  

Planning Method Based on Bus Route

作　　者：聂俊岚[1] 王小彦[1] 陈子军[1] 刘文远[1] 

机构地区：[1]燕山大学信息科学与工程学院,河北秦皇岛066004

出　　处：《小型微型计算机系统》2011年第6期1201-1204,共4页Journal of Chinese Computer Systems

基　　金：国家自然科学基金项目(60773100)资助

摘　　要：提出一种用于公交路线规划的最优路径查询方法.利用最优位置选择思想,在给定源点和终点的路网中找到k最短路径中最优性值最大的路径,即客流量最大的路径,为进行公交路线规划提供参考.采用k最短路径算法找到长度满足条件的k最短路径,然后对这k最短路径上的一些特殊顶点(如路口)进行最优性查询,从而找到k最短路径中最优性值最大的路径.最后,通过实验验证该方法的有效性.Presented the optimal path query methods for a bus route planning.Based on the optimal-location-selection ideas,the path with biggest optimality can be found from the k shortest paths which are found in the road network given source point and the end point,namely passenger capacity biggest path,so as to provide the reference for the public transportation route plan.Finding k shortest path based on the k shortest path algorithm,and then to some special vertices of the k shortest path carry on optimality processing,so the biggest optimality path is found from the k shortest path.Finally,the validity of method is verified through the experiment.

关 键 词：路网规划 最优性值 最优路径 空间数据库查询 

分 类 号：TP311[自动化与计算机技术—计算机软件与理论]