公交线路查询算法的设计与实现  

Design and Implementation of Query Algorithm for Public Transportation

作　　者：周潜[1] 欧宜贵[1] 

机构地区：[1]海南大学信息科学技术学院,海南海口570228

出　　处：《海南大学学报（自然科学版）》2010年第2期105-107,共3页Natural Science Journal of Hainan University

基　　金：海南省自然科学基金项目(80552);海南省教育厅基金项目(HJSK200730)

摘　　要：以图的赋权邻接矩阵为切入点,建立了以换乘次数最小为首要目标,途径站点数最小为第二目标的公交出行最优路径模型;同时,回避了最短路径算法时间复杂度大的缺点,以最短路径矩阵为数据系统,提出了解决公交查询的通用高效算法;最后,通过公交查询系统实例证实了其可行性和有效性.Based on the adjacent matrix with weight of graph, an optimum route model with the minimal transfer times as primary goal and the minimal stops as second goal was established, which solve the time complexity of the shortest path algorithm. The shortest path matrix was used as data system, and a general and high-efficient algorithm was proposed for solving the query for public transport. Finally, the availability and feasibility of the algorithm were confirmed by an example of the query system for public transport.

关 键 词：赋权邻接矩阵 最优路径 换乘 途径站点数 

分 类 号：O157.6[理学—数学] O246[理学—基础数学]