DocumentCode
145293
Title
Study of shortest path algorithm dynamic model based on half space
Author
Wu Feng ; LiYue Ying
Author_Institution
Dept. of Comput. Sci., Xinyang Agric. Coll., Xinyang, China
Volume
1
fYear
2014
fDate
26-28 April 2014
Firstpage
585
Lastpage
587
Abstract
In GIS field, the efficiency of shortest path search algorithm is widely existed and need to be resolved imminently. In this paper, author analyzes the optimization means based on dijkstra algorithm and brings forward his optimization schemes half space optimizing dijkstra´s shortest path algortithm form two aspects optimization of data storge configuration and searching direction. Compared to the conventional method, this algorithm saves more than 1/3 ROM and doubles the operational efficiency.
Keywords
geographic information systems; optimisation; Dijkstra algorithm; GIS; dynamic model; geographic information systems; half space; optimization; shortest path algorithm; Algorithm design and analysis; Educational institutions; Equations; Heuristic algorithms; Mathematical model; Optimization; Roads; dijkstra algorithm; half space; shortest path;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Science, Electronics and Electrical Engineering (ISEEE), 2014 International Conference on
Conference_Location
Sapporo
Print_ISBN
978-1-4799-3196-5
Type
conf
DOI
10.1109/InfoSEEE.2014.6948181
Filename
6948181
Link To Document