Research Article
A Dynamic Travel Time Estimation Model Based on Connected Vehicles
Table 1
Optimal path and cost by traditional routing algorithm and the dynamic routing algorithm.
| Method | Cost | Route |
| Traditional routing algorithm | 6780.62 m | 1→10→11→18→17→16→22→32→40→31→30→46 | The dynamic routing algorithm | 00:00:00 | 419.05 s | 1→2→3→4→5→36→23→24→41→27→30→46 | 09:00:00 | 481.95 s | 1→2→3→4→5→36→23→24→41→27→30→46 | 13:00:00 | 605.56 s | 1→2→3→4→5→36→23→24→41→27→30→46 | 17:00:00 | 851.92 s | 1→2→3→4→5→6→15→37→38→40→31→30→46 |
|
|