The paper presents two approaches for analyzing the route and departure time choice decisions, and the time varying traffic flow patterns in any network form. The first approach uses the framework of existing dynamic assignment models and therefore consists of a macroscopic traffic flow simulation model and a demand adjustment mechanism. In the second approach, dynamic assignment is formulated as an optimization program the solution of which is proved to be unique and equivalent to the dynamic equilibrium conditions. The analysis indicates that in highly congested networks, the application of static assignment models results in travel times which are lower than those predicted by the dynamic assignment procedures.
Two Models for Predicting Dynamic Stochastic Equilibria in Urban Transportation Networks
1990
23 pages
Report
No indication
English
Transportation & Traffic Planning , Transportation , Road Transportation , Management Information Systems , Transportation networks , Urban transportation , Route preferences , Travel patterns , Transportation models , Travel time , Mathematical models , Travel demand , Algorithms , Matrices(Mathematics) , Traffic simulation , Traffic flow , Urban areas , Stochastic processes , Transportation planning , Traffic management , Highway transportation , Foreign technology
Two Models for Predicting Dynamic Stochastic Equilibria in Urban Transportation Networks
British Library Conference Proceedings | 1990
|Computing dynamic user equilibria for large-scale transportation networks
Online Contents | 2006
|Computing dynamic user equilibria for large-scale transportation networks
Online Contents | 2006
|Stochastic Assignment to Transportation Networks: Models and Algorithms
Springer Verlag | 1998
|