Algorithm for solving K-shortest paths problem in complicated network

DOI10.3724/SP.J.1087.2008.00951MaRDI QIDQ3643881zbMATH OpenOpenAlexFDO

Authors Liu Jia, Shaofang Xia, Yanan Lv, Lichao Chen

Publication date 10 November 2009

Published in Journal of Computer Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3724/sp.j.1087.2008.00951

zbMATH Keywords

\(A^*\) algorithm\(K\)-shortest pathsmulti-graph

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Programming involving graphs or networks (90C35)

Recommendations

• Near-shortest and K-shortest simple paths
• A simplification of the double-sweep algorithm to solve the \(k\)-shortest path problem
• Finding theKth shortest path in a time-schedule network
• An enhanced K-SP algorithm with pruning strategies to solve the constrained shortest path problem
• Finding the K Shortest Loopless Paths in a Network

Cited in

(2)

• Implementation of algorithms forK shortest loopless paths
• A simplification of the double-sweep algorithm to solve the \(k\)-shortest path problem

This page was built for publication: Algorithm for solving K-shortest paths problem in complicated network

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3643881)