AbstractThe aim of this study is to establish a method to calculate good quality user equilibrium assignments under time varying conditions. For this purpose, it introduces a dynamic network loading method that can maintain correct flow propagation as well as flow conservation, and it shows a novel route-based solution algorithm. This novel algorithm turns out to be convenient and logically plausible compared to the conventional [Frank, M., Wolfe, P., 1956. An algorithm for quadratic programming. Naval Research Logistics Quarterly 3, 95–110] algorithm, because the former does not require evaluation of an objective function and it finds solutions maintaining correct flow propagation in the time-varying network conditions. The application of novel dynamic network loading method and solution algorithm to test networks shows that we can find high quality dynamic user equilibrium assignment. This is illustrated in an example network using the deterministic queuing model for a link performance function and associating costs and flows in a predictive way in discrete time.
A route-based solution algorithm for dynamic user equilibrium assignments
Transportation Research Part B: Methodological ; 41 , 10 ; 1094-1113
2007-01-01
20 pages
Article (Journal)
Electronic Resource
English
A route-based solution algorithm for dynamic user equilibrium assignments
Online Contents | 2007
|Calculation of dynamic traffic equilibrium assignments
British Library Conference Proceedings | 1999
|Formulations of Extended Logit Stochastic User Equilibrium Assignments
British Library Conference Proceedings | 1999
|A comparison of system optimum and user equilibrium dynamic traffic assignments with schedule delays
Online Contents | 1995
|