Table 6 Comparison of three algorithms for routing from node 155 to node 40.
From: Shortest path planning and dynamic rescue forces dispatching for urban flood disasters
\(S=155,D=40\) | Modified Dijkstra Algorithm | A Customized A* Algorithm | A Preference-based Customized A* Algorithm |
|---|---|---|---|
Number of nodes explored in the algorithm | 54 | 25 | 35 |
Algorithm running time (ms) | 36.90 | 22.94 | 32.89 |
Path | [155, 32, 35, 25, 31, 37, 38, 39, 40] | [155, 32, 35, 25, 31, 37, 38, 39, 40] | [155, 32, 35, 25, 21, 160, 14, 15, 18, 19, 30, 40] |
Vehicle travel time (min) | 17.15 | 17.15 | 28.55 |
Proportion of primary roads in the path | 75% | 75% | 90.91% |
