DocumentCode :
1991445
Title :
Research on an improved algorithm for shortest path searching in urban traffic based on GIS
Author :
Qi, Minju ; Sun, Huaining ; Gao, Guangfa
Author_Institution :
Dept. of Comput. Inf. Eng., Huainan Normal Univ., Huainan, China
fYear :
2011
fDate :
16-18 Sept. 2011
Firstpage :
1184
Lastpage :
1187
Abstract :
The shortest path problem is always a principal issue in the applications of GIS. After the analysis of the existing shortest path searching algorithms, and with a view to the actual state of the urban traffic, an improved adjacency matrix was presented, when a new improved shortest path searching algorithm based on GIS was proposed. Meanwhile, combining the present city traffic existent problem, a dynamic shortest weighted path searching algorithm in urban traffic was preliminary developed. All those can be referenced for scientific management in urban traffic.
Keywords :
geographic information systems; matrix algebra; road traffic; traffic engineering computing; GIS; adjacency matrix; dynamic shortest weighted path searching algorithm; dynamic traffic management; geographic information system; scientific management; urban traffic; Algorithm design and analysis; Educational institutions; Geographic Information Systems; Heuristic algorithms; Search problems; Transportation; GIS; dynamic traffic management; shortest path; urban traffic; weighted shortest path;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Electrical and Control Engineering (ICECE), 2011 International Conference on
Conference_Location :
Yichang
Print_ISBN :
978-1-4244-8162-0
Type :
conf
DOI :
10.1109/ICECENG.2011.6057906
Filename :
6057906
Link To Document :
بازگشت