Simulation of Real-Time Path Planning for Large-Scale Transportation Network Using Parallel Computation

摘要

To guarantee both the efficiency and accuracy of the transportation system, the real-time status should be analyzed to provide a reasonable plan for the near future. This paper proposes a model for simulating the real-world transportation networks by representing the irregular road networks with static and dynamic attributes, and the vehicles as moving agents constrained by the road networks. The all pairs shortest paths (APSP) for the networks are calculated in a real-time manner, and the ever-changing paths can be used for navigating the moving vehicles with real-time positioning devices. In addition, parallel computation is used to accelerate the shortest path searching and vehicle navigation. The testing results suggest that considerable time reduction can be realized in comparison with the non-real-time computations. This finding demonstrates that the proposed model is useful in improving the efficiency of a large-scale transportation system.