TY  - JOUR
PY  - 2011//
TI  - Shortest path improved algorithm based on GIS under large-scale disaster
JO  - Journal of traffic and transportation engineering (Xi'an, Shaanxi)
A1  - Yu, De-Xin
A1  - Yang, Wang
A1  - Yang, Zhao-Sheng
SP  - 123
EP  - 126
VL  - 11
IS  - 4
N2  - The Dijkstra algorithm under large-scale disaster was improved by using classical Dijkstra algorithm, and the function of penalty factor was built. Complex network analysis function was realized by using Visual C++ 6.0 and the secondary development module of GIS. The impacts of node quantity on road reliability and the selection of optimal path under large-scale disaster were analyzed. Distance, travel time and node quantity were considered, the advantage of improved Dijkstra algorithm in the selection of optimal path was proved. Analysis result shows that the node quantities computed by improved Dijkstra algorithm and classical Dijkstra algorithm are 31, 59 respectively, travel times are almost same. So the improved algorithm can reduce the node quantity in evacuation route effectively, and decrease the delay loss and risk of vehicle at the node. 1 tab, 2 figs, 11 refs.<p />
LA  - 
SN  - 1671-1637
UR  - http://dx.doi.org/
ID  - ref1
ER  -