Parallel Shortest Path Graph Computations of United States Road Network Data on Apache Spark

Author(s):  
Yasir Arfat ◽  
Rashid Mehmood ◽  
Aiiad Albeshri
2011 ◽  
Vol 121-126 ◽  
pp. 1296-1300 ◽  
Author(s):  
Jun Bi ◽  
Jie Zhang ◽  
Wen Le Xu

The shortest path between the start node and end node plays an important role in city’s road traffic network analysis system. The basic ant colony system algorithm which is a novel simulated evolutionary algorithm is studied to solve the shortest path problem. But the basic ant colony system algorithm is easy to run into the local optimum solution for shortest path. In order to solve the problem, the improved ant colony system algorithm is proposed. The improvement methods for selection strategy, local search, and information quantity modification of basic ant colony system are discussed in detail. The experiments are done in Beijing road network in China. The results of experiments show that comparing with the basic ant colony algorithm, the improved algorithm can easily converge at the global optimum for the shortest path.


2011 ◽  
Vol 14 (4) ◽  
pp. 389-413 ◽  
Author(s):  
Tao Cheng ◽  
James Haworth ◽  
Jiaqiu Wang

2011 ◽  
Vol 57 (6) ◽  
pp. 530
Author(s):  
Sung-Hyun Shin ◽  
Sang-Wook Kim ◽  
Junghoon Lee ◽  
Sang-Chul Lee ◽  
EulGyu Im

Sign in / Sign up

Export Citation Format

Share Document