Abstract: An efficient algorithm designed for shortest-path search in ITS environment is introduced. Based on Dijkstra’s algorithm, it speeds up the progressing by significantly reducing the search space according to the preprocessing result. Experimental study shows that this algorithm means to reduce the search space by 94.8% and speed the computation up to 26 times while simultaneously preserves the optimum.

摘要： 文章针对智能交通系统中最短路径问题，提出了一种基于预处理剪枝的最短路径快速搜索算法。此算法在Dijkstra算法的基础上，利用预处理结果进行剪枝。实验证明，与传统算法相比，在保证最优解的情况下，使用本算法平均可使搜索空间平均降低94.8%，计算速度提高26倍。