一种公交换乘路线智能选择的新方法

公交换乘问题是公共交通信息查询的重要内容,本文首先叙述了经典Dijkstra算法,并分析了其不适合公交网络最优路径选择的原因。然后提出了一种改进的Dijkstra算法,该算法将求解最短路径获得的站点作为搜索站点,并将这些站点及经过这些站点的线路构成换乘矩阵,结合换乘次数的要求,给出了基于Dijkstra的智能选择换乘线路的实现算法。最后通过一个实际算例说明改进的Dijkstra算法在公交换乘路线选择中应用的可行性。

A new intelligent method of optimal route choice of public traffic network

Public traffic transfer is an important problem to public traffic querying. The paper firstly describes the classical Dijkstra algorithm, and analyzes the reason that it is not fit to optimum route selection of public transportation network. Then the paper presents an advanced Dijkstra algorithm, this algorithm takes the stations which are the solution of the shortest path problem as the searched stations, and makes up of the transfer matrix with those stations and the traffic lines passing by, according to the request of the transfer time, the paper puts forward a transfer arithmetic based on Dijkstra algorithm. Finally, the paper proves the feasibility of the improved Dijkstra algorithm applying to Optimal Route Choice by an example.