skip to main content

Title: Analytical Method to Approximate the Impact of Turning on the Macroscopic Fundamental Diagram
Network macroscopic fundamental diagrams (MFDs) have recently been shown to exist in real-world urban traffic networks. The existence of an MFD facilitates the modeling of urban traffic network dynamics at a regional level, which can be used to identify and refine large-scale network-wide control strategies. To be useful, MFD-based modeling frameworks require an estimate of the functional form of a network’s MFD. Analytical methods have been proposed to estimate a network’s MFD by abstracting the network as a single ring-road or corridor and modeling the flow–density relationship on that simplified element. However, these existing methods cannot account for the impact of turning traffic, as only a single corridor is considered. This paper proposes a method to estimate a network’s MFD when vehicles are allowed to turn into or out of a corridor. A two-ring abstraction is first used to analyze how turning will affect vehicle travel in a more general network, and then the model is further approximated using a single ring-road or corridor. This approximation is useful as it facilitates the application of existing variational theory-based methods (the stochastic method of cuts) to estimate the flow–density relationship on the corridor, while accounting for the stochastic nature of turning. Results more » of the approximation compared with a more realistic simulation that includes features that cannot be captured using variational theory—such as internal origins and destinations—suggest that this approximation works to estimate a network’s MFD when turning traffic is present. « less
; ;
Award ID(s):
Publication Date:
Journal Name:
Transportation Research Record: Journal of the Transportation Research Board
Page Range or eLocation-ID:
933 to 947
Sponsoring Org:
National Science Foundation
More Like this
  1. Relationships between average network productivity and accumulation or density aggregated 2 across spatially compact regions of urban networks—so called network Macroscopic Fundamental 3 Diagrams (MFDs)—have recently been shown to exist. Various analytical methods have been put 4 forward to estimate a network’s MFD as a function of network properties, such as average block 5 lengths, signal timings, and traffic flow characteristics on links. However, real street networks are 6 not homogeneous—they generally have a hierarchical structure where some streets (e.g., arterials) 7 promote higher mobility than others (e.g., local roads). This paper provides an analytical method 8 to estimate the MFDs of hierarchical street networks by considering features that are specific to 9 hierarchical network structures. Since the performance of hierarchical networks is driven by how 10 vehicles are routed across the different street types, two routing conditions— user equilibrium and 11 system optimal routing—are considered in the analytical model. The proposed method is first 12 implemented to describe the MFD of a hierarchical one-way limited access linear corridor and 13 then extended to a more realistic hierarchical two-dimensional grid network. For both cases, it is 14 shown that the MFD of a hierarchical network may no longer be unimodalmore »or concave as 15 traditionally assumed in most MFD-based modeling frameworks. These findings are verified using 16 simulations of hierarchical corridors. Finally, the proposed methodology is applied to demonstrate 17 how it can be used to make decisions related to the design of hierarchical street network structures.« less
  2. Recent studies have leveraged the existence of network macroscopic fundamental diagrams (MFD) to develop regional control strategies for urban traffic networks. Existing MFD-based control strategies focus on vehicle movement within and across regions of an urban network and do not consider how freeway traffic can be controlled to improve overall traffic operations in mixed freeway and urban networks. The purpose of this study is to develop a coordinated traffic management scheme that simultaneously implements perimeter flow control on an urban network and variable speed limits (VSL) on a freeway to reduce total travel time in such a mixed network. By slowing down vehicles traveling along the freeway, VSL can effectively meter traffic exiting the freeway into the urban network. This can be particularly useful since freeways often have large storage capacities and vehicles accumulating on freeways might be less disruptive to overall system operations than on urban streets. VSL can also be used to change where freeway vehicles enter the urban network to benefit the entire system. The combined control strategy is implemented in a model predictive control framework with several realistic constraints, such as gradual reductions in freeway speed limit. Numerical tests suggest that the combined implementation of VSLmore »and perimeter metering control can improve traffic operations compared with perimeter metering alone.« less
  3. Real-time traffic data at intersections is significant for development of adaptive traffic light control systems. Sensors such as infrared radiation and GPS are not capable of providing detailed traffic information. Compared with these sensors, surveillance cameras have the potential to provide real scenes for traffic analysis. In this research, a You Only Look Once (YOLO)-based algorithm is employed to detect and track vehicles from traffic videos, and a predefined road mask is used to determine traffic flow and turning events in different roads. A Kalman filter is used to estimate and predict vehicle speed and location under the condition of background occlusion. The result shows that the proposed algorithm can identify traffic flow and turning events at a root mean square error (RMSE) of 10. The result shows that a Kalman filter with an intersection of union (IOU)-based tracker performs well at the condition of background occlusion. Also, the proposed algorithm can detect and track vehicles at different optical conditions. Bad weather and night-time will influence the detecting and tracking process in areas far from traffic cameras. The traffic flow extracted from traffic videos contains road information, so it can not only help with single intersection control, but also providesmore »information for a road network. The temporal characteristic of observed traffic flow gives the potential to predict traffic flow based on detected traffic flow, which will make the traffic light control more efficient.« less
  4. The development of traffic models based on macroscopic fundamental diagrams (MFD) enables many real-time control strategies for urban networks, including cordon-based pricing schemes. However, most existing MFD-based pricing strategies are designed only to optimize the traffic-related performance, without considering the revenue collected by operators. In this study, we investigate cordon-based pricing schemes for mixed networks with urban networks and freeways. In this system, heterogeneous commuters choose their routes based on the user equilibrium principle. There are two types of operational objective for operating urban networks: (1) to optimize the urban network’s performance, that is, to maximize the outflux; and (2) to maximize the revenue for operators. To compare those two objectives, we first apply feedback control to design pricing schemes to optimize the urban network’s performance. Then, we formulate an optimal control problem to obtain the revenue-maximization pricing scheme. With numerical examples, we illustrate the difference between those pricing schemes.
  5. This paper proposes a new meta-learning method – named HARMLESS (HAwkes Relational Meta LEarning method for Short Sequences) for learning heterogeneous point process models from short event sequence data along with a relational network. Specifically, we propose a hierarchical Bayesian mixture Hawkes process model, which naturally incorporates the relational information among sequences into point process modeling. Compared with existing methods, our model can capture the underlying mixed-community patterns of the relational network, which simultaneously encourages knowledge sharing among sequences and facilitates adaptive learning for each individual sequence. We further propose an efficient stochastic variational meta expectation maximization algorithm that can scale to large problems. Numerical experiments on both synthetic and real data show that HARMLESS outperforms existing methods in terms of predicting the future events.