1. Parallel Route Optimization Algorithm of Central Guidance
- Author
-
Juan Meng, Hong Chen, and Hu Xing Zhou
- Subjects
Optimization algorithm ,Computer science ,Distributed computing ,Computer cluster ,Transfer (computing) ,Node (networking) ,General Medicine - Abstract
To solve the problem that the central guidance system takes too long time to calculate the shortest routes between all node pairs of network which can not meet the real-time demand of central guidance, this paper presents a central guidance parallel route optimization method based on parallel computing technique involving both route optimization time and travelers preferences by means of researching three parts: network data storage based on an array, multi-level network decomposition with travelers preferences considered and parallel shortest route computing of deque based on messages transfer. And based on the actual traffic network data of Guangzhou city, the suggested method is verified on three parallel computing platforms including ordinary PC cluster, Lenovo server cluster and HP workstations cluster. The results show that above three clusters finish the optimization of 21.4 million routes between 5631 nodes of Guangzhou city traffic network in 215, 189 and 177 seconds with the presented method respectively, which can completely meet the real-time demand of the central guidance.
- Published
- 2013