基于LBS的最优出行路径算法的研究与应用

Study of the algorithm of optimal route navigation based on LBS and its application

文章是基于LBS移动二次定位位置服务平台进行最优出行路径的研究。研究的目的是在LBS移动定位平台上实现基于出行者决策的最优路径选取,对人们选择最佳出行路线进行导航;在最优出行路径方面将问题分为最短路径算法和路径的权值2个问题;在最短路径算法方面选取了Dijkstra算法,并采用分层搜索、动态限制搜索区域算法对Dijkstra进行辅助,提高算法响应速度;在路径权值的确定方面,采用基于出行者决策的理论模型,对该决策算法进行适当调整,对路径权值重新裁定。

This paper studies the optimal route navigation based on LBS of the mobile secondary positioning services platform. The study intends to provide the necessary traffic information and point out the optimal route. Optimal remote search is the core of the motion location services equipment, and it plays a decision-making role in the urban traffic. The classical Dijkstra algorithm is adopted to deal with the best shortest path, and the hierarchical search algorithm and the dynamic regional restrictions search algorithm are also used as an aid for the Dijkstra algorithm so as to reduce the complexity of time and space. In order to determine the weight of the path and to make the optimal route consistent with the actual users＇ travel need, the decision-making algorithm has to be adjusted properly.