Computing k shortest paths from a source node to each other node
2015 (English)In: Soft Computing - A Fusion of Foundations, Methodologies and Applications, ISSN 1432-7643, E-ISSN 1433-7479, Vol. 19, no 8, 2391-2402 p.Article in journal (Refereed) Published
The single-pair K shortest path (KSP) problem can be described as finding k least cost paths through a graph between two given nodes in a non-decreasing order, while single-source KSP algorithms aim to find KSPs from a given node to each other node. However, little effort has been devoted to the single-source KSP approaches. This paper proposes a novel single-source KSP algorithm in a given directed weighted graph where loops are allowed. The proposed method is designed to compute a set of shortest paths with exactly k distinctive lengths in a non-decreasing order. Meanwhile, it can also find all shortest paths with the length less than a given threshold. Inspired by water flowing principle, we imagine that there are waters flowing from a source node to each other node along edges at a constant speed. When the water reaches a node, the node will generate new waters flowing along its outgoing edges. By stepping back the traces of the water, the ordered shortest paths can be obtained. We also address the correctness and effectiveness of the method. Simulations are carried out using synthetic data and practical graph data, which demonstrate the considerable performance of the proposed approach especially for single-source KSP problems.
Place, publisher, year, edition, pages
Springer Berlin/Heidelberg, 2015. Vol. 19, no 8, 2391-2402 p.
K shortest path problem, Single-pair KSP, Single-source KSP
IdentifiersURN: urn:nbn:se:kth:diva-174942DOI: 10.1007/s00500-014-1434-2ISI: 000361484700022ScopusID: 2-s2.0-84937419139OAI: oai:DiVA.org:kth-174942DiVA: diva2:862467
QC 201510222015-10-222015-10-092015-11-05Bibliographically approved