Fast path planning of large-scale road network based on hierarchical contraction algorithm
Chuangyu zhu, Bin Ji · 2024
China's road network construction is expanding on a large scale, leading to a complex and intricate network connection. As the economy grows, there is a rise in people's travel demand, resulting in frequent road congestion and diverse user travel preferences. This paper examines the challenge of path planning in a large-scale road network under a situation where users have multiple preferences. A path planning model is developed to accommodate the user's preferences for traveling distance, time, and vehicle fuel consumption. Improved contraction hierarchies are suggested to enhance fast path planning in large road networks based on these preferences. The suggested approach is tested using numerical simulation on the road network data in Hubei Province and compared with Dijkstra's algorithm, BiDijkstra's algorithm, and A* algorithm. The test findings confirm that enhanced contraction hierarchies can efficiently determine superior path planning strategies in various preference circumstances across diverse scales.