Paper
28 August 2024 Optimization of Multi-OD shortest path model algorithm based on common computing
Cao Qiqi
Author Affiliations +
Proceedings Volume 13251, Ninth International Conference on Electromechanical Control Technology and Transportation (ICECTT 2024); 1325145 (2024) https://doi.org/10.1117/12.3039529
Event: 9th International Conference on Electromechanical Control Technology and Transportation (ICECTT 2024), 2024, Guilin, China
Abstract
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.
(2024) Published by SPIE. Downloading of the abstract is permitted for personal use only.
Cao Qiqi "Optimization of Multi-OD shortest path model algorithm based on common computing", Proc. SPIE 13251, Ninth International Conference on Electromechanical Control Technology and Transportation (ICECTT 2024), 1325145 (28 August 2024); https://doi.org/10.1117/12.3039529
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Roads

Transportation

Algorithm development

Mathematical optimization

Matrices

Modeling

Operating systems

Back to Top