公交网络最优路径求解算法的回溯实现  

Implementation of backtracking public traffic path searching algorithm

作　　者：伍雁鹏[1] 彭小奇[2] 李仁明[1] 

机构地区：[1]邵阳学院网络中心,湖南邵阳422000 [2]中南大学能源科学与工程学院,湖南长沙410083

出　　处：《湖南农业大学学报（自然科学版）》2008年第3期379-382,共4页Journal of Hunan Agricultural University(Natural Sciences)

基　　金：邵阳市科技计划项目(53J07)

摘　　要：为解决大规模公交网络最优路径查询模型中的换乘问题,提出一种回溯的公交网络最优路径求解算法:首先求解具有最短出行时间的最优路径的片段信息,然后回溯推导出最优路径的完整路径信息.算法所需内存少,查询效率高,能很好解决公交网络换乘问题.Traditional shortest path searching algorithm can＇t solve the transfer problem in the optimal path searching model of large scale public transport network. An optimal path searching algorithm of public transport network based on backtracking is present. After finding out fragment information of optimal path with shortest time value, this algorithm backtrack and search other information to complete whole optimal path information. This algorithm needs less memory with high efficiency. Experimental results show the algorithm can solve the transfer problem perfectly.

关 键 词：公交网络 公交换乘 最优路径 回溯 

分 类 号：U491[交通运输工程—交通运输规划与管理]