Full-Text Search:
Home|Journal Papers|About CNKI|User Service|FAQ|Contact Us|中文
《Journal of Highway and Transportation Research and Development》 2006-08
Add to Favorite Get Latest Update

Research on Urban Road Network Shortest Path Heuristic Algorithm

LIU Ming-long1,HUANG De-Yong1,XU Tian-ze2(1.Kunming University of Science and Technology,Yunnan Kunming 650093,China;2.Yunnan Police Academy,Yunnan Kunming 650223,China)  
With the development of geographic information science and the wide use of GIS software,there are more demand for network analyses.This paper introduces a new algorithm to get the shortest path between two points in urban road network,based on the geographic characteristic of the road network.The algorithm improved the searching way of Dijkstra's algorithm by making use of heuristic information to search along the most suitable path.It can greatly reduce the searching space,increase the searching speed and be of important practical significance.
【Fund】: 云南省自然科学基金资助项目(2003E0086M)
【CateGory Index】: U491.1
Download(CAJ format) Download(PDF format)
CAJViewer7.0 supports all the CNKI file formats; AdobeReader only supports the PDF format.
©2006 Tsinghua Tongfang Knowledge Network Technology Co., Ltd.(Beijing)(TTKN) All rights reserved