A Dynamic Algorithm to Acquire the Shortest Path in Rescue System
Ming Zhao · Journal of Shenyang Jianzhu University · 2011
The paper aims to resolve the shortest path of rescue vehicles with uncertain path information,and provide relief goods timely to reduce economic damage and bad social influence caused by magnitude natural disaster.Dijkstra algorithm is used to establish an initial shortest path which is used by emergency vehicle.If it is impossible to go along,based on initial shortest path information and according to the change of road conditions,a new shortest path can be obtained using Dijkstra algorithm adversely.Through verification and analysis of simulation experiment,results show that dynamic algorithm is able to get the new shortest path correctly and effectively.It reduces about 50% of the computing time compared with the brute-force algorithm.The new dynamic algorithm can be applied in computing the shortest path in rescue system,which provides reference values in emergence path choosing during disaster rescue.