Formulating the within-day dynamic stochastic traffic assignment problem from a Bayesian perspective

This study proposes a formulation of the within-day dynamic stochastic traffic assignment problem. Considering the stochastic nature of route choice behavior, we treat the solution to the assignment problem as the conditional joint distribution of route traffic, given that the network is in dynamic stochastic user equilibrium. We acquire the conditional joint probability distribution using Bayes’ theorem. A Metropolis–Hastings sampling scheme is developed to estimate the characteristics (e.g., mean and variance) of the route traffic. The proposed formulation has no special requirements for the traffic flow models and user behavior models, and so is easily implemented.

[1]  W. K. Hastings,et al.  Monte Carlo Sampling Methods Using Markov Chains and Their Applications , 1970 .

[2]  Larry J. LeBlanc,et al.  An Algorithm for the Discrete Network Design Problem , 1975 .

[3]  Carlos F. Daganzo,et al.  On Stochastic Models of Traffic Assignment , 1977 .

[4]  Kenneth E. Train,et al.  Discrete Choice Methods with Simulation , 2016 .

[5]  Martin L. Hazelton,et al.  Bayesian inference for day-to-day dynamic traffic models , 2013 .

[6]  Sangjin Han,et al.  A Route-Based Solution Algorithm for Dynamic User Equilibrium Assignments , 2007 .

[7]  Shing Chung Josh Wong,et al.  A predictive dynamic traffic assignment model in congested capacity-constrained road networks , 2000 .

[8]  Y. Asakura,et al.  The posterior probability distribution of traffic flow: a new scheme for the assignment of stochastic traffic flow , 2013 .

[9]  N. Metropolis,et al.  Equation of State Calculations by Fast Computing Machines , 1953, Resonance.

[10]  David Watling.  A SECOND ORDER STOCHASTIC NETWORK EQUILIBRIUM MODEL.. , 2002 .

[11]  Takamasa Iryo,et al.  Multiple equilibria in a dynamic traffic network , 2011 .

[12]  E. Cascetta,et al.  A DAY-TO-DAY AND WITHIN-DAY DYNAMIC STOCHASTIC ASSIGNMENT MODEL , 1991 .

[13]  John W. Polak,et al.  STATIONARY STATES IN STOCHASTIC PROCESS MODELS OF TRAFFIC ASSIGNMENT: A MARKOV CHAIN MONTE CARLO APPROACH , 1996 .

[14]  Agachai Sumalee,et al.  Dynamic stochastic transit assignment with explicit seat allocation model , 2009 .

[15]  E. Cascetta.  A stochastic process approach to the analysis of temporal dynamics in transportation networks , 1989 .

[16]  W. Y. Szeto,et al.  A cell-based variational inequality formulation of the dynamic user optimal assignment problem , 2002 .

[17]  Robert B. Dial,et al.  A PROBABILISTIC MULTIPATH TRAFFIC ASSIGNMENT MODEL WHICH OBVIATES PATH ENUMERATION. IN: THE AUTOMOBILE , 1971 .

[18]  Martin L. Hazelton,et al.  Total Travel Cost in Stochastic Assignment Models , 2003 .

[19]  Masao Kuwahara,et al.  Decomposition of the reactive dynamic assignments with queues for a many-to-many origin-destination pattern , 1997 .

[20]  Martin L. Hazelton.  Some Remarks on Stochastic User Equilibrium , 1998 .

[21]  David P. Watling,et al.  A Second Order Stochastic Network Equilibrium Model, I: Theoretical Foundation , 2002, Transp. Sci..

[22]  C. Geyer.  Markov Chain Monte Carlo Maximum Likelihood , 1991 .

[23]  Sangjin Han,et al.  Dynamic traffic modelling and dynamic stochastic user equilibrium assignment for general road networks , 2003 .