摘要
提出一种基于“节点删除”的多路径获取算法 ,可以用来为动态路径诱导系统 (DRGS)提供多条“合理的”候选路径 .该算法比传统的“k-最短路算法”和基于“重叠惩罚”的多路径算法更简单、快捷和有效 .
This paper presents a new algorithm based on 'Node deletion' to acquire k_reasonable alternative paths for dynamic route guidance systems. Compared with traditional k_shortest path algorithm and 'overlapping penalty' algorithm, this algorithm is simple, fast and effective.
出处
《北方交通大学学报》
CSCD
北大核心
2002年第2期77-81,共5页
Journal of Northern Jiaotong University