摘要
在含有禁止转向、单行、拥挤等约束下的城市路网中,研究任意节点间最优路径问题。利用车载导航系统的信息,在Floyd算法迭代规则的基础上,引入禁行路径的判断规则,给出了一种适用的路径寻优迭代算法。该算法对一般网络具有一般性,能够获得即时、完整地路径走向和最优结果。仿真试验结果表明,该算法使用方便,具有很好的应用价值。
The optimal routing problem between two arbitrary nodes in the city network is resolved, of which contains roads with restraints such as restricted, crowded and one-way routes. Using of information obtained from vehicle navigation system and on the basis of the iterative rules of Floyd algorithm, and with the introduction of the restricted path judging rules, an application of the iterative algorithm for path optimization is presented. The algorithm not only can deal with the general networks, but also gets instant, complete direction for optimal paths. The simulation shows that the algorithm is easy to use, and has its potential value.
出处
《计算机工程与设计》
CSCD
北大核心
2009年第4期956-959,共4页
Computer Engineering and Design
