This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2010 International Conference on Machine Vision and Human-machine Interface
A Novel Shortest Path Method Based on Heuristic Algorithm
Kaifeng, China
April 24-April 25
ISBN: 978-0-7695-4009-2
ASCII Text
x 
 
Yangeng Wen, Weihua Zang, Chen Li, "A Novel Shortest Path Method Based on Heuristic Algorithm," Machine Vision and Human-machine Interface, International Conference on, pp. 545-548, 2010 International Conference on Machine Vision and Human-machine Interface, 2010.
 
 
BibTex
x
 
@article{ 10.1109/MVHI.2010.157,
author = {Yangeng Wen and Weihua Zang and Chen Li},
title = {A Novel Shortest Path Method Based on Heuristic Algorithm},
journal ={Machine Vision and Human-machine Interface, International Conference on},
volume = {0},
year = {2010},
isbn = {978-0-7695-4009-2},
pages = {545-548},
doi = {http://doi.ieeecomputersociety.org/10.1109/MVHI.2010.157},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Machine Vision and Human-machine Interface, International Conference on
TI - A Novel Shortest Path Method Based on Heuristic Algorithm
SN - 978-0-7695-4009-2
SP545
EP548
A1 - Yangeng Wen,
A1 - Weihua Zang,
A1 - Chen Li,
PY - 2010
KW - Dijkstra algorithm
KW - shortest path
KW - heuristic strategy
KW - the dynamic direction restricted algorithm
VL - 0
JA - Machine Vision and Human-machine Interface, International Conference on
ER -
 
Classic Dijdstra algorithm and heuristic strategy were discussed. A dynamic direction restricted searching algorithm is presented, based on the Dijkstra algorithm for computing shortest path from one node to another node in road net. In comparison with classic Dijdstra algorithm, the searching algorithm, combined with human searching thought and flexible handle, could change restricted area dynamically and save computation time. The efficiency of computing shortest path was improved by this algorithm only and better effects were given when this algorithm was combined with other algorithms. The results of comparative experiments show that the dynamic direction restricted searching algorithm led to almost a saving ratio of 50 %, in terms of both number of nodes selected and computation times.
Index Terms:
Dijkstra algorithm, shortest path, heuristic strategy, the dynamic direction restricted algorithm
Citation:
Yangeng Wen, Weihua Zang, Chen Li, "A Novel Shortest Path Method Based on Heuristic Algorithm," mvhi, pp.545-548, 2010 International Conference on Machine Vision and Human-machine Interface, 2010
Usage of this product signifies your acceptance of the Terms of Use.