摘要
通过对Dial算法和K条渐短路径搜索算法的比较分析,重新定义有效路径,进而提出基于交通网络遍历的有效路径搜索算法。算例结果表明,该方法是可行有效的。
From the study of Dial＇s algorithm and the algorithm of K-shortest path, the concept of efficient path is redefined and further an efficient path search algorithm is developed based on traffic network. Numerical results show that this algorithm is feasible and efficient.
出处
《交通标准化》
2008年第1期137-140,共4页
Communications Standardization
