Optimization of Multi-OD shortest path model algorithm based on common computing

In today's urban transportation networks, it is often necessary to seek the shortest distance between two locations to reduce the transportation time. In this study, a shortest path model with the objective of shortest travel time is developed for the shortest path problem in urban road networks, and a multi-OD shortest path algorithm based on common computing is proposed based on this model. The model and the algorithm are used to test their operating speeds on a large road network and compare them with conventional algorithms. The results show that the multi-OD shortest path algorithm based on common computation is correct and more efficient, which can satisfy the users' needs of choosing between different shortest paths and greatly improve the computational efficiency in the case of large-scale road networks.