论文部分内容阅读
公交换乘问题是公共交通信息查询的重要内容,本文首先叙述了经典Dijkstra算法,并分析了其不适合公交网络最优路径选择的原因。然后提出了一种改进的Dijkstra算法,该算法将求解最短路径获得的站点作为搜索站点,并将这些站点及经过这些站点的线路构成换乘矩阵,结合换乘次数的要求,给出了基于Dijkstra的智能选择换乘线路的实现算法。最后通过一个实际算例说明改进的Dijkstra算法在公交换乘路线选择中应用的可行性。
The bus transfer problem is an important part of public transportation information query. This paper first describes the classic Dijkstra algorithm and analyzes the reasons why it is not suitable for the optimal route selection of public transport network. Then, an improved Dijkstra algorithm is proposed, which takes the stations obtained by solving the shortest path as the search stations and constructs the transfer matrix of these stations and the lines passing through these stations. Combined with the requirements of transfer times, Intelligent selection of transfer lines to achieve algorithm. Finally, a practical example is given to illustrate the feasibility of the improved Dijkstra algorithm in bus transfer route selection.