Abstract

This paper mainly focuses on distributed and parallel search strategy of shortest path in urban road network, which is motivated by the fact that in the shortest path search in complicated urban road network, the search time consumed will increase sharply with the increase of the number of road network nodes. In the algorithm presented in the paper, the whole search road network is first cut into local sub-search road networks, and connections among each local sub-search road network are established through virtual auxiliary nodes; then searches of the shortest paths in local sub-search road networks are conducted in a parallel manner. Finally, the shortest path search of the whole network is completed on the basis of local and parallel search by the virtual auxiliary nodes. The shortest path problem from single-origin to single-destination is studied and analyzed. The correctness of the algorithm is proved.

Full Text

Published Version

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.