Abstract: In intelligent transportation system(ITS), best path and shortest path computation are very important to vehicle navigation, and with the improvement of real time traffic information be acquired, best path computation is used more frequently than the shortest path in many application. Also, there are thousands of nodes and edges in ITS GIS. So, these application systems need an efficient implementation to Dijkstra arithmetic, one of the shortest path arithmetic. In ITS, through index list, Dijkstra arithmetic can run much more efficiently compared with original Dijkstra arithmetic.

Key words: Dijkstra arithmetic, Best path, Intelligent transportation system(ITS), Vehicle navigation

摘要： 在智能交通系统中，最佳路径和最短路径的计算是车辆导航功能重要环节，由于越来越多的实时信息参与计算，使得计算行车时间最短的路径变得更频繁，加上道路网络的结点数量和路段数量多，因此，对算法的效率也就要求更高。目前最常用的最佳路径/最短路径算法之一是Dijkstra算法。在智能交通系统中，通过建立相关的数据索引表，可以高效地实现Dijkstra算法，与原始算法相比，大大提高了效率。

关键词: Dijkstra算法, 最佳路径, 智能交通, 车辆导航