DynamicsofTrafficFlowsinCombinedDay-to-dayandWith-.pptVIP

Dynamics of Traffic Flows in Combined Day-to-day and With-in Day Context Chandra Balijepalli ITS, Leeds 15-16 September 2004 Objectives of this Presentation To introduce the combined day-to-day and with-in day context of dynamic traffic assignment To introduce the extended method of approximation To discuss the issues in computing the parameters e.g., jacobians of travel time functions To discuss some numerical results The Context Day-to-day dynamics: drivers’ learning and adjusting With-in day dynamics: delays along the route based on prevailing traffic conditions Not dealing with departure time choice Literature Review Cantarella, G.E. and Cascetta, E. (1995) Dynamic Processes and Equilibrium in Transportation Networks: Towards a Unifying Theory, Transportation Science 29(4), 305-329 Davis, G.A. and Nihan, N.L. (1993) Large Population Approximations of a General Stochastic Traffic Assignment Model, Operations Research 41(1), 169-178 Friesz, T.L., Bernstein, D., Smith, T.E., Tobin, R.L. and Wie,B.W. (1993) A Variational Inequality Formulation of the Dynamic Network User Equilibrium Problem, Operations Research 41(1), 179-191 Hazelton, M. and Watling, D. (2004) Computation of Equilibrium Distributions of Markov Traffic Assignment Models, Transportation Science 38(3), 331-342 The Extended Method of Approximation Assume the drivers are indistinguishable and rational in minimising their perceived travel cost Measured travel costs are updated using m = memory length λ = memory weighting The number of drivers taking each possible route on day n during time period T, conditional on the weighted average of costs, is obtained as independently for T = 1,2,… qT = demand during time period t pT(.) = route choice probability vector Conditional Moments Then the expectation and variance of the conditional distribution for each time period would be Unconditional Moments Based on standard results, the unconditional first moment is given as