Traffic Assignment Problem for Footpath Networks with Bidirectional Links
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.
Code (0)
등록된 구현이 없습니다.
Tasks
Equilibrium traffic assignmentMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
An Approach to Avoid the Unreal High Flows on Congested Links and Investigates the Evolution of Congestion over Network
The unreal high flows may appear on the actually congested links in the result when a monotonically increasing link travel time function of flow volume is adopted in traffic assignment. The fixed link flow results of a s…
End-to-End Heterogeneous Graph Neural Networks for Traffic Assignment
The traffic assignment problem is one of the significant components of traffic flow analysis for which various solution approaches have been proposed. However, deploying these approaches for large-scale networks poses si…
Equilibrium traffic assignmentGraph AttentionGraph Neural NetworkManagementMulti-Class Traffic Assignment using Multi-View Heterogeneous Graph Attention Networks
Solving traffic assignment problem for large networks is computationally challenging when conventional optimization-based methods are used. In our research, we develop an innovative surrogate model for a traffic assignme…
Graph AttentionData-Driven Traffic Assignment: A Novel Approach for Learning Traffic Flow Patterns Using a Graph Convolutional Neural Network
We present a novel data-driven approach of learning traffic flow patterns of a transportation network given that many instances of origin to destination (OD) travel demand and link flows of the network are available. Ins…
A bio-inspired algorithm for fuzzy user equilibrium problem by aid of Physarum Polycephalum
The user equilibrium in traffic assignment problem is based on the fact that travelers choose the minimum-cost path between every origin-destination pair and on the assumption that such a behavior will lead to an equilib…