From Corridor to Network Macroscopic Fundamental Diagrams: A Semi-Analytical Approximation Approach

Abstract

The design of network-wide traffic management schemes or transport policies for urban areas requires computationally efficient traffic models. The macroscopic fundamental diagram (MFD) is a promising tool for such applications. Unfortunately, empirical MFDs are not always available, and semi-analytical estimation methods require a reduction of the network to a corridor that introduces substantial inaccuracies. We propose a semi-analytical methodology to estimate the MFD for realistic urban networks without the information loss induced by the reduction of networks to corridors. The methodology is based on the method of cuts but applies to networks with irregular topologies, accounts for different spatial demand patterns, and determines the upper bound of network flow. Therefore, we consider both flow conservation and the effects of spillbacks at the network level. Our framework decomposes a given network into a set of corridors, creates a hypernetwork, including the impacts of source terms, and then treats the dependencies across corridors (e.g., because of turning flows and spillbacks). Based on this hypernetwork, we derive the free-flow and capacity branch of the MFD. The congested branch is estimated by considering gridlock characteristics and utilizing recent advancements in MFD research. We showcase the applicability of the proposed methodology in a case study with a realistic setting based on the Sioux Falls network. We then compare the results to the original method of cuts and a ground truth derived from the cell transmission model. This comparison reveals that our method is more than five times more accurate than the state of the art in estimating the network-wide capacity and jam density. Moreover, the results clearly indicate the MFD’s dependency on spatial demand patterns. Compared with simulation-based MFD estimation approaches, the potential of the proposed framework lies in the modeling flexibility, explanatory value, and reduced computational cost. Funding: G. Tilg acknowledges support from the German Federal Ministry for Digital and Transport (BMDV) for the funding of the project LSS (capacity increase of urban networks). S. F. A. Batista and M. Menéndez acknowledge support from the NYUAD Center for Interacting Urban Networks (CITIES), funded by Tamkeen under the NYUAD Research Institute Award [CG001]. L. Ambühl acknowledges support from the ETH Research Grant [ETH-27 16-1] under the project name SPEED. L. Leclercq acknowledges funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation program Grant [646592 - MAGnUMproject]. Supplemental Material: The e-companion is available at https://doi.org/10.1287/trsc.2022.0402 .