Research on the Algorithm for K-Shortest Paths Problem based on A* in Complicated Network
Lichao Chen, Jia Liu, Yingjun Zhang, Binhong Xie · 2007
Focusing on the optimization problems about complicated network, this paper presents an algorithm KSPA to solve the K-shortest paths problem in complicated network based on A* algorithm, in which the time cost is taken as target function and the establishment of the target function model is given. Experimental results show the proposed KSPA maintains an excellent efficiency on certain public traffic data. It can be used to solve the K-shortest paths problems in multi-graph.