Research on the Algorithm for Shortest Path Problem in Complicated Network

Yanfei Cao · Techniques of Automation and Applications · 2010

Focusing on the optimization problems about complicated network,this paper presents an algorithm to solve the 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 that the algorithm proposed can be used to solve the shortest paths problems quickly in multi-graph.

Read the paper · More papers on PaperTik