Name
Abstract | ||
|---|---|---|
The paper presents a newly shortest path algorithm aiming at the point-to-point problems in traffic network. The algorithm makes use of the axiom that distance is less than path based on the characteristics of transportation network. The test compared with the typical Dijkstra shows the validity and efficiency of the proposed algorithm. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1109/IGARSS.2014.6947142 | IGARSS |
Keywords | Field | DocType |
geophysical techniques,geophysics computing,shortest path algorithm,geographic information system,typical dijkstra,transport network,point-to-point problems,transportation network,traffic network | Mathematical optimization,Shortest path problem,Computer science,Constrained Shortest Path First,Yen's algorithm,Suurballe's algorithm,Shortest Path Faster Algorithm,Widest path problem,K shortest path routing,Euclidean shortest path | Conference |
ISSN | Citations | PageRank |
2153-6996 | 0 | 0.34 |
References | Authors | |
3 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Xiucheng Yang | 1 | 32 | 7.04 |
| Danfeng Liu | 2 | 0 | 0.34 |
| Lin Cong | 3 | 30 | 9.99 |
| Ligang Liang | 4 | 12 | 1.11 |