In this paper,a new algorithm is presented to determine the shortest paths in a network in which some link or some links are changed.The algorithm takes less CPU time and internal memory than the other algorithms existed, so mag be used in transportation planning of large scale networks.
Yin Lianglong
, Gu Baonan. , {{custom_author.name_en}}.
An Algorithm to Finding the Shortest Path in a Changes Network. Systems Engineering - Theory & Practice, 1995, 15(3): 26-31 https://doi.org/10.12011/1000-6788(1995)3-26