Research on large-scale road network partition and route search method combined with traveler preferences

7Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

Abstract

Combined with improved Pallottino parallel algorithm, this paper proposes a large-scale route search method, which considers travelers' route choice preferences. And urban road network is decomposed into multilayers effectively. Utilizing generalized travel time as road impedance function, the method builds a new multilayer and multitasking road network data storage structure with object-oriented class definition. Then, the proposed path search algorithm is verified by using the real road network of Guangzhou city as an example. By the sensitive experiments, we make a comparative analysis of the proposed path search method with the current advanced optimal path algorithms. The results demonstrate that the proposed method can increase the road network search efficiency by more than 16% under different search proportion requests, node numbers, and computing process numbers, respectively. Therefore, this method is a great breakthrough in the guidance field of urban road network. © 2013 De-Xin Yu et al.

Cite

CITATION STYLE

APA

Yu, D. X., Yang, Z. S., Yu, Y., & Jiang, X. R. (2013). Research on large-scale road network partition and route search method combined with traveler preferences. Mathematical Problems in Engineering, 2013. https://doi.org/10.1155/2013/950876

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free