基于最少换乘路径选择算法的改进  

Improvements for Optimal Path Selection Algorithm with Minimum Transfer Times

作　　者：景丽荣[1] 马尚才[1] 沈亮[1] JING Li-rong, MA Shang-cai, SHEN Liang（Information Management,Shanxi University of Finance ＆ Economics,Taiyuan 030006,China）

机构地区：[1]山西财经大学信息管理学院,山西太原030006

出　　处：《电脑知识与技术》2010年第1期168-170,共3页Computer Knowledge and Technology

摘　　要：最短路径是图论研究中一个最基本的算法问题,也是公交出行路线选择系统中的关键技术之一。通过分析研究目前比较流行的最短路径算法,根据人们选择出行路线的心理,提出以最少换乘为第一目标,最短路径为第二目标的思想,并以其作为基准点,对传统的广度优先搜索算法中存在的问题做出适当的改进。The shortest path problem is a classic algorithm issue in Graph Theory study,and it is also one of the key technologies in Bus Travel Route Choice System.In this paper,by analyzing the shortest path algorithms which is an idea prevails currently and considering people＇s psychology when choosing travel routes,the minimum transfer times is regarded as the main principle and the shortest path followed is proposed.Based on the discussion above,appropriate improvements are made to the traditional Breadth First Search algorithm.

关 键 词：最短路径 广度优先搜索算法 最少换乘 

分 类 号：TP301[自动化与计算机技术—计算机系统结构;自动化与计算机技术—计算机科学与技术]