Article ID: | iaor20012842 |
Country: | United Kingdom |
Volume: | 34B |
Issue: | 8 |
Start Page Number: | 625 |
End Page Number: | 644 |
Publication Date: | Nov 2000 |
Journal: | Transportation Research. Part B: Methodological |
Authors: | Wong S.C., Tong C.O. |
Keywords: | networks: path |
In this paper, a predictive dynamic traffic assignment model in congested capacity-constrained road networks is formulated. A traffic simulator is developed to incrementally load the traffic demand onto the network, and updates the traffic conditions dynamically. A time-dependent shortest path algorithm is also given to determine the paths with minimum actual travel time from an origin to all the destinations. The traffic simulator and time-dependent shortest path algorithm are employed in a method of successive averages to solve the dynamic equilibrium solution of the problem. A numerical example is given to illustrate the effectiveness of the proposed method.