摘要
城市交通中道路拥堵情况多变,在车辆行进过程中两点间最短路径会发生改变。文章提出基于Dijkstra的动态更新算法,同时考虑必经结点对算法的影响,计算复杂度大大降低。文中给出了算法的理论依据,处理过程及最终效果图。
The complexion of the road in the city changed with the time,the shortest path between two nodes will be changed when the vehicle is iunning.In this paper,we introduce a new dynamic algorithm based on Dijkstra,and take into account of the obligatory nodes,the calculate complication can be reduced.We specify the theory of the algorithm, the process and the graph of the effect.
出处
《计算机工程与应用》
CSCD
北大核心
2006年第28期227-229,共3页
Computer Engineering and Applications
基金
北京市共建项目(编号:SYS100040409)
关键词
动态更新
最短路径
必经结点
dynamic reoptimization, shortest path, obligatory nodes
