Abstract
The paper presents research aimed at unifying the fields of (i) dynamic network equilibrium, (ii) dynamic whole-link models and (iii) stochastic process models of between- and within-day dynamics. An approximation result and computational procedure is derived for determining the equilibrium probability distribution of a within- and between-day dynamic stochastic process traffic assignment model. The method is based on an analytic procedure requiring only knowledge of within-day dynamic stochastic user equilibrium flows, together with the Jacobians of the dynamic network loading map and of the choice probability function. An implementation is reported with a particular form of whole-link, continuous-time, dynamic network loading model, commonly found in the literature on dynamic traffic assignment, where travel times at the time of entry to a link are a function of the number of vehicles on the link at that time. Illustrative numerical examples are presented.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
