Papers
Topics
Authors
Recent
Search
2000 character limit reached

Traffic Assignment Problem for Footpath Networks with Bidirectional Links

Published 6 Dec 2020 in eess.SY, cs.SY, math.OC, and physics.soc-ph | (2012.03389v4)

Abstract: The estimation of pedestrian traffic in urban areas is often performed with computationally intensive microscopic models that usually suffer from scalability issues in large-scale footpath networks. In this study, we present a new macroscopic user equilibrium traffic assignment problem (UE-pTAP) framework for pedestrian networks while taking into account fundamental microscopic properties such as self-organization in bidirectional streams and stochastic walking travel times. We propose four different types of pedestrian volume-delay functions (pVDFs), calibrate them with empirical data, and discuss their implications on the existence and uniqueness of the traffic assignment solution. We demonstrate the applicability of the developed UE-pTAP framework in a small network as well as a large scale network of Sydney footpaths.

Citations (8)

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.