基于最少换乘的公交最优路径算法的设计与实现

Modern Realization of Public Traffic Optimal Path Based on Least Transfers

提出了基于最少换乘的公交最优路径理论,在此基础上设计了公交最少换乘的算法。由于算法本身的独特性,笔者将“图算法”部署到空间网络数据库中加以实现,利用数据库的快速查询、索引支持和在集合运算方面的优秀性能解决了算法的效率问题。同时还利用此类数据库系统对空间查询的支持,确保算法在求取最少换乘后可以兼顾距离最短的要求。

The theory of the optimum query of public transportation based on the least transfers is put forward, and the algorithm to realize it is designed. The graph algorithm is tried to realize based on the spatial network database, making use of the quick query, index support and the collection operation of database to acquire excellent efficiency, and making use of spatial query support of such type of database to ensure that the algorithm can get the shortest path after getting the least transfers.