Link Count Data-driven Static Traffic Assignment Models Through Network Modularity Partitioning
Accurate static traffic assignment models are important tools for the assessment of strategic transportation policies. In this article we present a novel approach to partition road networks through network modularity to produce data-driven static traffic assignment models from loop detector data on large road systems. The use of partitioning allows the estimation of the key model input of Origin-Destination demand matrices from flow counts alone. Previous network tomography-based demand estimation techniques have been limited by the network size. The amount of partitioning changes the Origin-Destination estimation optimisation problems to different levels of computational difficulty. Different approaches to utilising the partitioning were tested, one which degenerated the road network to the scale of the partitions and others which left the network intact. Applied to a subnetwork of England's Strategic Road Network and other test networks, our results for the degenerate case showed flow and travel time errors are reasonable with a small amount of degeneration. The results for the non-degenerate cases showed that similar errors in model prediction with lower computation requirements can be obtained when using large partitions compared with the non-partitioned case. This work could be used to improve the effectiveness of national road systems planning and infrastructure models.
Code (0)
등록된 구현이 없습니다.
Methods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Data-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…
Modeling the residual queue and queue-dependent capacity in a static traffic assignment problem
The residual queue during a given study period (e.g., peak hour) is an important feature that should be considered when solving a traffic assignment problem under equilibrium for strategic traffic planning. Although stud…
Traffic estimation in unobserved network locations using data-driven macroscopic models
This paper leverages macroscopic models and multi-source spatiotemporal data collected from automatic traffic counters and probe vehicles to accurately estimate traffic flow and travel time in links where these measureme…
Travel Time EstimationTraffic and weather driven hybrid digital twin for bridge monitoring
A hybrid digital twin framework is presented for bridge condition monitoring using existing traffic cameras and weather APIs, reducing reliance on dedicated sensor installations. The approach is demonstrated on the Peace…
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…