Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2013, Article ID 950876, 8 pages
Research Article

Research on Large-Scale Road Network Partition and Route Search Method Combined with Traveler Preferences

1State Key Laboratory of Automobile Simulation and Control, School of Traffic, Jilin University, Changchun 130025, China
2School of Traffic, Jilin University, Changchun 130025, China

Received 5 September 2013; Accepted 24 October 2013

Academic Editor: Wuhong Wang

Copyright © 2013 De-Xin Yu et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


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.