Abstract: In this paper, the real-time path searching problem for the larger traffic network is investigated in the developing software—DynaCHINA, and an effective path generation algorithm is proposed. Additionally, a new data structure is provided to store large count of paths and support high performance searching. By the recursive property, the new algorithm can reduce the size of problem which derives the paths with a small space required. As a result, it improves the computing speed greatly in real-time path searching and saves the computer memory resource significantly. Compared with original algorithms, it is found that the proposed algorithm deals with the real-time path searching problem in large traffic network quickly and effectively with a small computer memory. Therefore, the algorithm can be used in practical traffic management.

Key words: large traffic network, real-time;path searching, recursive algorithm, DynaCHINA

摘要： 对在研的DynaCHINA软件中大规模交通网络下的实时路径搜索问题进行了研究。提出了新的设计思想，给出了有效路径的产生算法，并设计了支持海量路径数据的存储及高效检索的数据结构。算法充分利用路径的递归特性，降低问题的规模，实现了较小空间花费下的海量路径随机查询。大大提高了大规模交通网络中实时路径搜索问题的计算速度，节省了计算机存储资源。通过与原有算法比较表明，本算法能够在较小的计算机存储资源下，快速有效的处理大规模交通网络中的实时路径搜索问题，具有广阔的应用前景和现实意义。

关键词: 大规模交通网络, 实时, 路径搜索, 递归算法, 动态中国