Algorithm for solving K-shortest paths problem in complicated network
Xia Shao-fang · Journal of Computer Applications · 2008
Focusing on the optimization problems about complicated network,an algorithm named KSPA(K-Shortest Paths based on A)was proposed to solve the K-shortest paths problem in complicated network.The time cost was taken as target function and the establishment of the target function model was given.Experimental results show the KSPA algorithm proposed can be used to solve the K-shortest paths problems quickly in multi-graph.