最短路径问题（SP）是人工智能的一个活跃研究方向，也是交通网络分析系统的一个最基本问题，在理论和应用上有着广泛而深入的研究。本文从应用的角度，结合地理信息系统（GIS）的特点，设计了一种新的数据存储结构，改进节点搜索方法，并建立一种简捷的估价函数，为进一步解决交通网络的综合分析打下了基础。

Best first search is a general heuristic search algorithm for shortest path problem. Its applicability is limited by its exponential memory requirement. In this paper, a new data structure for storing traffic network is presented. The search procedure is improved on the advantage of this data structure. On the other hand, a new heuristic estimate function based on the characteristic of GIS is discussed in this paper. The improved algorithm is used in a traffic analysis system.