This invention proposes an efficient K-short path calculation method and
system for dynamic
road networks, relating to the field of path planning technology. It involves obtaining multiple OD pairs from a
directed graph of the road network, constructing a
list, and initializing it. For each OD pair, a shortest path is calculated, and a set of deviation paths is constructed based on the shortest path. The shortest path and the set of deviation paths are stored as an initial K-short path set. When the edge weights of the road
network structure are adjusted, potentially affected OD pairs are screened based on the changed edge attributes and the initial K-short path set. The initial K-short paths from the potentially affected OD pairs are obtained, and a substantial
impact test is performed: if an initial K-short path does not contain any changed edges, and its
path cost is less than the total cost of potential new paths constructed from the changed edges, then the path is retained; otherwise, the path is deleted. New paths are supplemented based on the set of deviation paths until K shortest paths are satisfied, thereby significantly reducing computational complexity and improving the efficiency and accuracy of path updates in dynamic scenarios.