一种基于GIS的公交路线最短路径搜索算法

An Algorithm for Searching the Shortest Path of Bus Route Based on GIS

利用公交线路路口作为顶点,简化了传统算法对复杂网络拓扑图的计算;同时,利用乘客出行偏好,引入线网密度来评价乘客的出行方便程度,并提出了一种最短路径快速搜索算法.实验证明,与传统算法相比,该算法明显提高了路径搜索效率.

This paper simplifies the traditional algorithm for the complicated network topology map by using the crossing of the bus route as the vertex. It uses route network density to evaluate the passenger＇ s choice behavior. Finally, an efficient algorithm for searching the shortest path is proposed. Experiment shows that this algorithm can obviously improve efficiency of shortest path search compared with other traditional algorithms.