基于ITS的加速最短路径搜索算法研究

The Research of Quicken Up Shortest Path Finding Algorithm Based on ITS

文章从路径搜索的基本原理入手,首先介绍了经典Dijkstra最短路径搜索算法,分析比较了基于堆结构和基数堆结构的Dijkstra算法的搜索效率,从而提出了采用多层地图和分级搜索技术来实现对最短路径搜索空间的控制策略和算法,结合湛江市区电子地图进行对比实验,该算法有效地解决了最短路径搜索效率的问题。

This article starts with the path finding principle,first introduces the tradition Dijkstra shortest path finding algorithm,then compares the Dijkstra algorithm efficiency of heap structure based with radices heap structure.We put forward a control strategy and algorithm for realization shortest path finding space using multiplayer map and hierarchical finding technology,Finally we integrate Zhanjiang electronic map with imitating experiment,the result is that hierarchical finding algorithm quickens up the shortest path finding algorithm greatly.