中文摘要：

针对实际城市交通路网最优路径规划中存在的计算效率问题，研究了最优路径算法的快速实现技术，提出了一种双向启发式A＊诱导算法。在分析经典Dijkstra算法和A＊启发式搜索算法的基础上，利用双向A＊算法分解搜索空间，采用完全二叉堆结构来实现计算过程中数据的存取，从而提高了算法的执行效率。实际路网仿真结果证明了该算法的优异性能。

英文摘要：

Computational efficiency is widely recognized to be an essential issue in the optimal route planning against realistic urban road traffic network, the fast search technology is studied and a bidirectional heuristic A＊ algorithm is presented. Based on analysis of classic Dijkstra algorithm and heuristic A＊algorithm, bidirectional heuristic A＊is used to decompose the search space and binary heap data structure is utilized to operate data. Simulation results against real data demonstrate performance boost.