DocumentCode
3396652
Title
Fast computation method for route calculation
Author
Feng Wen ; Mabu, Shingo ; Hirasawa, K.
Author_Institution
Grad. Sch. of Inf., Production & Syst., Waseda Univ., Kitakyushu, Japan
fYear
2011
fDate
19-22 Aug. 2011
Firstpage
1857
Lastpage
1860
Abstract
This paper introduces a speedup method for the optimal route calculation on large size road networks by pre processing and pre-computing. A hierarchical network structure is constructed by separating a large network into several sub networks. The boundary nodes partitioned the original network are new nodes in the higher level network. The new road sections on the multilevel network are decided by pre-computing the shortest path between the boundary nodes of each sub-network. A clustering method based on genetic algorithm is proposed. By the proposed method, the number of boundary nodes and road sections between boundary nodes of each sub-network can be reduced greatly. Then, the computational time for route calculation on this hierarchical network can be deceased sharply. Experimental results show that the efficiency of the proposed method.
Keywords
genetic algorithms; network theory (graphs); pattern clustering; roads; transportation; fast computation method; genetic algorithm; hierarchical network structure; large network; multilevel network; optimal route calculation; road networks; shortest path; Cities and towns; Clustering algorithms; Clustering methods; Computers; Genetic algorithms; Partitioning algorithms; Roads;
fLanguage
English
Publisher
ieee
Conference_Titel
Mechatronic Science, Electric Engineering and Computer (MEC), 2011 International Conference on
Conference_Location
Jilin
Print_ISBN
978-1-61284-719-1
Type
conf
DOI
10.1109/MEC.2011.6025846
Filename
6025846
Link To Document