Table 2 Performance of different path searching algorithm
From: Bi-level route guidance method for large-scale urban road networks
| Â | Failure rate of path searching | Average time of path searching (s) | Minimum time of path searching (s) | Maximum time of path searching (s) | Node number |
|---|---|---|---|---|---|
Overall path searching | 2/1000 | 2.67 | 0.80 | 7.22 | 68 |
Algorithm of this paper | 7/1000 | 1.68 | 0.42 | 4.59 | 36 |