Name
Title | ||
|---|---|---|
Research on the Algorithm for K-Shortest Paths Problem based on A* in Complicated Network |
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1109/COGINF.2007.4341919 | IEEE ICCI |
Keywords | Field | DocType |
target function model,target function,algorithm kspa,complicated network,certain public traffic data,optimization problem,proposed kspa,k-shortest paths problem,excellent efficiency,multigraph,shortest path problem,optimization,a algorithm,functional model,transportation,shortest path,graph theory | Graph theory,Mathematical optimization,Multigraph,Algorithm,Road traffic,Function model,Optimization problem,A* search algorithm,Mathematics | Conference |
ISBN | Citations | PageRank |
978-1-4244-1327-0 | 0 | 0.34 |
References | Authors | |
13 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Li-Chao Chen | 1 | 14 | 7.02 |
| Jia Liu | 2 | 0 | 0.68 |
| Ying Jun (Angela) Zhang | 3 | 1905 | 135.63 |
| Bin-hong Xie | 4 | 0 | 1.35 |