DocumentCode :
2971445
Title :
Comparing Study of Route Planning Algorithms Based on Hierarchical Strategy
Author :
Cai Wenxue ; Zheng Yanwu ; Shi Yongqiang ; Zhao Na ; Zhang Meng
Author_Institution :
Sch. of Econ. & Commerce, South China Univ. of Technol., Guangzhou, China
fYear :
2011
fDate :
12-14 Aug. 2011
Firstpage :
1
Lastpage :
4
Abstract :
Hierarchical strategy is widely used in route planning algorithms to improve the computing efficiency. Hierarchical and Partitioned A-star (HPA) algorithm and Highway Hierarchies (HHs) algorithm are two famous algorithms that use the strategy. When use route planning service, both computing efficiency and planning rationality are concerned. Some improvement was taken to make the HAP algorithm more suitable for the real road network. Then a large scale random test is taken on the road network of Guangdong Province, compare to the HHs algorithm and the planar a* algorithm, the experimental results show that the amended HPA (AHPA) algorithm is more efficient and the planning result is more reasonable.
Keywords :
roads; strategic planning; transportation; HAP algorithm; HH algorithm; hierarchical strategy; highway hierarchies algorithm; partitioned A-star algorithm; real road network; route planning algorithms; Algorithm design and analysis; Heuristic algorithms; Partitioning algorithms; Path planning; Planning; Roads; Switches;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Management and Service Science (MASS), 2011 International Conference on
Conference_Location :
Wuhan
Print_ISBN :
978-1-4244-6579-8
Type :
conf
DOI :
10.1109/ICMSS.2011.5998605
Filename :
5998605
Link To Document :
بازگشت