A three-dimensional macroscopic fundamental diagram for mixed bi-modal urban networks

Recent research has studied the existence and the properties of a macroscopic fundamental diagram (MFD) for large urban networks. The MFD should not be universally expected as high scatter or hysteresis might appear for some type of networks, like heterogeneous networks or freeways. In this paper, we investigate if aggregated relationships can describe the performance of urban bi-modal networks with buses and cars sharing the same road infrastructure and identify how this performance is influenced by the interactions between modes and the effect of bus stops. Based on simulation data, we develop a three-dimensional vehicle MFD (3D-vMFD) relating the accumulation of cars and buses, and the total circulating vehicle flow in the network. This relation experiences low scatter and can be approximated by an exponential-family function. We also propose a parsimonious model to estimate a three-dimensional passenger MFD (3D-pMFD), which provides a different perspective of the flow characteristics in bi-modal networks, by considering that buses carry more passengers. We also show that a constant Bus–Car Unit (BCU) equivalent value cannot describe the influence of buses in the system as congestion develops. We then integrate a partitioning algorithm to cluster the network into a small number of regions with similar mode composition and level of congestion. Our results show that partitioning unveils important traffic properties of flow heterogeneity in the studied network. Interactions between buses and cars are different in the partitioned regions due to higher density of buses. Building on these results, various traffic management strategies in bi-modal multi-region urban networks can then be integrated, such as redistribution of urban space among different modes, perimeter signal control with preferential treatment of buses and bus priority.     

On the fundamental diagram and supply curves for congested urban networks

Macroscopic fundamental diagrams (MFD) of traffic for some networks have been shown to have similar shape to those for single links. They have erroneously been used to help estimate the level of travel in congested networks. We argue that supply curves, which track vehicles in their passage through congested networks, are needed for this purpose, and that they differ from the performance curves generated from MFD. We use a microsimulation model, DRACULA and two networks, one synthesizing the network for Cambridge, England, and one of the city of York, England, to explore the nature of performance curves and supply curves under differing patterns of demand.We show that supply curves differ from performance curves once the onset of congestion is reached, and that the incorrect use of performance curves to estimate demand can thus seriously underestimate traffic levels, the costs of congestion, and the value of congestion relief measures. We also show that network aggregated supply curves are sensitive to the temporal distribution of demand and, potentially, to the spatial distribution of demand. The shape of the supply curve also differs between origin–destination movements within a given network.We argue that supply curves for higher levels of demand cannot be observed in normal traffic conditions, and specify ways in which they can be determined from microsimulation and, potentially, by extrapolating observed data. We discuss the implications of these findings for conventional modelling of network management policies, and for these policies themselves.     

An analytical approximation for the macroscopic fundamental diagram of urban traffic

This paper shows that a macroscopic fundamental diagram (MFD) relating average flow and average density must exist on any street with blocks of diverse widths and lengths, but no turns, even if all or some of the intersections are controlled by arbitrarily timed traffic signals. The timing patterns are assumed to be fixed in time. Exact analytical expressions in terms of a shortest path recipe are given, both, for the street’s capacity and its MFD. Approximate formulas that require little data are also given.For networks, the paper derives an upper bound for average flow conditional on average density, and then suggests conditions under which the bound should be tight; i.e., under which the bound is an approximate MFD. The MFD’s produced with this method for the central business districts of San Francisco (California) and Yokohama (Japan) are compared with those obtained experimentally in earlier publications.     

Properties of a well-defined macroscopic fundamental diagram for urban traffic

A field experiment in Yokohama (Japan) revealed that a macroscopic fundamental diagram (MFD) linking space-mean flow, density and speed exists on a large urban area. It was observed that when the highly scattered plots of flow vs. density from individual fixed detectors were aggregated the scatter nearly disappeared and points grouped along a well defined curve. Despite these and other recent findings for the existence of well-defined MFDs for urban areas, these MFDs should not be universally expected. In this paper we investigate what are the properties that a network should satisfy, so that an MFD with low scatter exists. We show that the spatial distribution of vehicle density in the network is one of the key components that affect the scatter of an MFD and its shape. We also propose an analytical derivation of the spatial distribution of congestion that considers correlation between adjacent links. We investigate the scatter of an MFD in terms of errors in the probability density function of spatial link occupancy and errors of individual links’ fundamental diagram (FD). Later, using real data from detectors for an urban arterial and a freeway network we validate the proposed derivations and we show that an MFD is not well defined in freeway networks as hysteresis effects are present. The datasets in this paper consist of flow and occupancy measures from 500 fixed sensors in the Yokohama downtown area in Japan and 600 loop detectors in the Twin Cities Metropolitan Area Freeway network in Minnesota, USA.     

Data fusion algorithm for macroscopic fundamental diagram estimation

A promising framework that describes traffic conditions in urban networks is the macroscopic fundamental diagram (MFD), relating average flow and average density in a relatively homogeneous urban network. It has been shown that the MFD can be used, for example, for traffic access control. However, an implementation requires an accurate estimation of the MFD with the available data sources.Most scientific literature has considered the estimation of MFDs based on either loop detector data (LDD) or floating car data (FCD). In this paper, however, we propose a methodology for estimating the MFD based on both data sources simultaneously. To that end, we have defined a fusion algorithm that separates the urban network into two sub-networks, one with loop detectors and one without. The LDD and the FCD are then fused taking into account the accuracy and network coverage of each data type. Simulations of an abstract grid network and the network of the city of Zurich show that the fusion algorithm always reduces the estimation error significantly with respect to an estimation where only one data source is used. This holds true, even when we account for the fact that the probe penetration rate of FCD needs to be estimated with loop detectors, hence it might also include some errors depending on the number of loop detectors, especially when probe vehicles are not homogeneously distributed within the network.     

An empirical analysis on the arterial fundamental diagram

For uninterrupted traffic flow, it is well-known that the fundamental diagram (FD) describes the relationship between traffic flow and density under steady state. For interrupted traffic flow on a signalized road, it has been recognized that the arterial fundamental diagram (AFD) is significantly affected by signal operations. But little research up to date has discussed in detail how signal operations impact the AFD. In this paper, based upon empirical observations from high-resolution event-based traffic signal data collected from a major arterial in the Twin Cities area, we study the impacts of g/C ratio, signal coordination, and turning movements on the cycle-based AFD, which describes the relationship between traffic flow and occupancy in a signal cycle. By microscopically investigating individual vehicle trajectories from event-based data, we demonstrate that not only g/C ratio constrains the capacity of a signalized approach, poor signal coordination and turning movements from upstream intersections also have significant impact on the capacity. We show that an arterial link may not be congested even with high occupancy values. Such high values could result from queue build-up during red light that occupies the detector, i.e. the Queue-Over-Detector (QOD) phenomenon discussed in this paper. More importantly, by removing the impact of QOD, a stable form of AFD is revealed, and one can use that to identify three different regimes including under-saturation, saturation, and over-saturation with queue spillovers. We believe the stable form of AFD is of great importance for traffic signal control because of its ability to identify traffic states on a signal link.     

Improving the accessibility of urban transportation networks for people with disabilities

What is the most effective way to enhance the accessibility of our oldest and largest public transportation systems for people with reduced mobility? The intersection of limits to government support with the growing mobility needs of the elderly and of people with disabilities calls for the development of tools that enable us to better prioritise investment in those areas that would deliver the greatest benefits to travellers. In principle and, to a lesser extent, in practice, many trains and buses are already accessible to nearly all users, leaving the stations and interchanges as the single largest and most expensive challenge facing operators trying to improve overall access to the network.Focussing on travel time and interchange differences, we present a method that uses network science and spatio-temporal analysis to rank stations in a way that minimises the divergence between accessible and non-accessible routes. Taking London as case study, we show that 50% of the most frequently followed journeys become 50% longer when wheelchair accessibility becomes a constraint. Prioritising accessibility upgrades using our network approach yields a total travel time that is more than 8 times better than a solution based on random choice, and 30% more effective than a solution that seeks solely to minimise the number of interchanges facing those with mobility constraints. These results highlight the potential for the analysis of ‘smart card’ data to enable network operators to obtain maximum value from their infrastructure investments in support of expanded access to all users.     

On the distribution of urban road space for multimodal congested networks

Transport systems in real cities are complex with many modes of transport sharing and competing for limited road space. This work intends to understand how space distributions for modes and interactions among modes affect network traffic performance. While the connection between performance of transport systems and general land allocation is the subject of extensive research, space allocation for interacting modes of transport is an open research question. Quantifying the impact of road space distribution on the performance of a congested multimodal transport system with a dynamic aggregated model remains a challenge. In this paper, a multimodal macroscopic fundamental diagram (MFD) is developed to represent the traffic dynamics of a multimodal transport system. Optimization is performed with the objective of minimizing the total passenger hours traveled (PHT) to serve the total demand by redistributing road space among modes. Pricing strategies are also investigated to provide a higher demand shift to more efficient modes. We find by an application to a bi-modal two-region city that (i) the proposed model captures the operational characteristics of each mode, and (ii) optimal dynamic space distribution strategies can be developed. In practice, the approach can serve as a physical dynamic model to inform space distribution strategies for policy makers with different goals of mobility.     

Optimal offsets for traffic signal systems in urban networks

The paper proposes a binary integer programming model for the computation of optimal traffic signal offsets for an urban road network. The basic theoretical assumptions for the computation of delay on the network are those employed by the main models developed during the last few years. The set of input data coincides with that needed for the Combination Method and its extensions. The model is solved through a branch-and-backtrack method and allows the obtaining of optimal offsets for condensable or uncondensable networks without introducing any special assumption on delay-offset functions, contrary to what occurs within other mathematical programming formulations of the problem. A reduced memory dimension is required by the developed algorithm, which promptly supplies during the computation better and better sub-optimal solutions, very interesting in view of the possible application of the method to real-time control problems. The tests performed show that the method can be applied to networks of practical size.     

Three-phase traffic theory and two-phase models with a fundamental diagram in the light of empirical stylized facts

Despite the availability of large empirical data sets and the long history of traffic modeling, the theory of traffic congestion on freeways is still highly controversial. In this contribution, we compare Kerner’s three-phase traffic theory with the phase diagram approach for traffic models with a fundamental diagram. We discuss the inconsistent use of the term “traffic phase” and show that patterns demanded by three-phase traffic theory can be reproduced with simple two-phase models, if the model parameters are suitably specified and factors characteristic for real traffic flows are considered, such as effects of noise or heterogeneity or the actual freeway design (e.g. combinations of off- and on-ramps). Conversely, we demonstrate that models created to reproduce three-phase traffic theory create similar spatiotemporal traffic states and associated phase diagrams, no matter whether the parameters imply a fundamental diagram in equilibrium or non-unique flow-density relationships. In conclusion, there are different ways of reproducing the empirical stylized facts of spatiotemporal congestion patterns summarized in this contribution, and it appears possible to overcome the controversy by a more precise definition of the scientific terms and a more careful comparison of models and data, considering effects of the measurement process and the right level of detail in the traffic model used.     

A fuzzy-based system for incident detection in urban street networks

Detecting incidents on urban streets or arterials using loop detector data is quite challenging. The pattern of the incident could be quite similar to non-incident cases as intersections get congested. This paper describes the development of a fuzzy logic for incident detection. An Integrated System for Incident Management (

-sim) was developed. An integral component of such system is a microscopic simulator,

-sim-s, an object-oriented model that allows for virtual detector installations at different locations, modeling different intersection layouts, traffic control types and timing, and link characteristics.

-sim-s was utilized to generate various incident scenarios and extracting associated detectors’ accumulative counts. A data clustering technique was utilized to consolidate the various incident scenarios into a single data set for the development of the Fuzzy Logic for incident detection at intersections (

-sim-fl). The

-sim-fl uses the detector data as well as other link properties in flagging detecting incidents.The

-sim-fl can be used to indicate the possibility of an incident, a stalled vehicle, or a sort of traffic disturbance. The devised logic was validated using separate simulation-based incident scenarios.     

An assignment principle for urban networks based on travel budgets

A new assignment principle for traveler behavior in an urban network is described which is based on empirical findings in the theory of travel budgets. It characterizes the distribution of travelers, demand, and modal split. It treats all travel decisions (whether to travel, where to go, how to get there) and the important costs (time and money) in a single, unified way. A numerical technique is proposed and it is applied to several examples to illustrate qualitative features.     

Deploying public charging stations for electric vehicles on urban road networks

This paper explores how to optimally locate public charging stations for electric vehicles on a road network, considering drivers’ spontaneous adjustments and interactions of travel and recharging decisions. The proposed approach captures the interdependency of different trips conducted by the same driver by examining the complete tour of the driver. Given the limited driving range and recharging needs of battery electric vehicles, drivers of electric vehicles are assumed to simultaneously determine tour paths and recharging plans to minimize their travel and recharging time while guaranteeing not running out of charge before completing their tours. Moreover, different initial states of charge of batteries and risk-taking attitudes of drivers toward the uncertainty of energy consumption are considered. The resulting multi-class network equilibrium flow pattern is described by a mathematical program, which is solved by an iterative procedure. Based on the proposed equilibrium framework, the charging station location problem is then formulated as a bi-level mathematical program and solved by a genetic-algorithm-based procedure. Numerical examples are presented to demonstrate the models and provide insights on public charging infrastructure deployment and behaviors of electric vehicles.     

Store-and-forward based methods for the signal control problem in large-scale congested urban road networks

The problem of designing network-wide traffic signal control strategies for large-scale congested urban road networks is considered. One known and two novel methodologies, all based on the store-and-forward modeling paradigm, are presented and compared. The known methodology is a linear multivariable feedback regulator derived through the formulation of a linear-quadratic optimal control problem. An alternative, novel methodology consists of an open-loop constrained quadratic optimal control problem, whose numerical solution is achieved via quadratic programming. Yet a different formulation leads to an open-loop constrained nonlinear optimal control problem, whose numerical solution is achieved by use of a feasible-direction algorithm. A preliminary simulation-based investigation of the signal control problem for a large-scale urban road network using these methodologies demonstrates the comparative efficiency and real-time feasibility of the developed signal control methods.     

Incorporating socio-political criteria into the maintenance prioritization of Chilean urban pavement networks

Managing urban pavement networks presents additional challenges when compared to the management of interurban pavements. In particular, the prioritization of maintenance activities – which is critical when resources are limited – requires special considerations. Within these considerations, there are socio-political criteria that are not formally considered in current UPMS (Urban Pavement Management Systems). In practice, decision makers consider these socio-political factors but without a formal procedure and proper information, leading to decisions based on subjective information, which lack traceability and reliability.The objective of this study is the identification and formal definition – including the quantification method – of socio-political criteria relevant for the sustainable management of urban pavement networks. The research method included the application of interviews and a survey of experts and practitioners in various agencies involved in the pavement maintenance decision-making process in Chile. As a result of the study, five primary socio-political criteria were identified: neighbors’ perception, proximity to critical infrastructure, benefited population, presence of alternative routes, and strategic selection based on public policy. These criteria were formalized – including how they should be quantified – through an expert panel. A regression analysis applied to various scenarios considered in the survey resulted in the quantification of the relative importance of the formalized socio-political factors to be considered in the decision process, complementing technical and economic criteria. Future research will explore the use of Geographic Information Systems (GIS) to quantify the recommended socio-political factors and implement them in an UPMS.     

Measuring marginal congestion costs of urban transportation: Do networks matter?

In determining the marginal cost of congestion, economists have traditionally relied upon directly measuring traffic congestion on network links, disregarding any “network effects,” since the latter are difficult to estimate. While for simple networks the comparison of the network-based congestion costs with the link-based ones can be done within a theoretical framework, it is important to know whether such network effects in real large-scale networks are quantitatively significant.In this paper we use a strategic transportation planning model (START) to compare marginal congestion costs computed link-by-link with measures taking into account network effects. We find that while in aggregate network effects are not significant, congestion measured on a single link is a poor predictor of total congestion costs imposed by travel on that link. Also, we analyze the congestion proliferation effect on the network to see how congestion is distributed within an urban area.     

Real-time estimation of turning movement proportions from partial counts on urban networks

Modern traffic signal control systems require reliable estimates of turning flows in real time to formulate effective control actions, and accommodate disturbances in traffic demand without deteriorating the system performance. The more accurate the estimation is, the more effective the control plan is. Most of the previous research works assumed that a full set of detector counts is available and employed the least-squares methods to produce unbiased estimates of the turning movement proportions. However, in practice, such a dense detector configuration is expensive to install and maintain. Also, the least-squares estimates are not feasible when the travel time between inflows and outflows is significant, or when intervening traffic conditions change the travel time. This study proposes a nonlinear least-square (NLS) approach and a quasi maximum likelihood (QML) approach to recursively estimate turning movement proportions in a network of intersections where only a partial set of detector counts are available. Using large population approximation technique, a class of nonlinear, discrete-time traffic flow models are transformed into a linear state–space model tractable for on-line applications. The quality of estimates is demonstrated by implementing the proposed algorithms with simulation and real data. As a comparison, the NLS estimator shows less bias but with higher variance than the QML estimator. The QML estimator outperforms the NLS estimator in terms of total mean square error, due to an increase in bias being traded for a decrease in variance.     

The role of congestion of transportation networks in urban location and travel choices

Congestion of urban transportation systems results from an equilibrium of location and travel choices with generalized travel costs which increase with vehicle flows as well as other factors. The use of network equilibrium concepts in analyzing urban policies and evaluating alternative plans is examined. Issues arising in the use of network equilibrium models are described, and formulations of urban network prediction and design models are explored.     

Modeling and optimization of multimodal urban networks with limited parking and dynamic pricing

Cruising-for-parking constraints mobility in urban networks. Car-users may have to cruise for on-street parking before reaching their destinations. The accessibility and the cost of parking significantly influence people's travel behavior (such as mode choice, or parking facility choice between on-street and garage). The cruising flow causes delays eventually to everyone, even users with destinations outside limited parking areas. It is therefore important to understand the impact of parking limitation on mobility, and to identify efficient parking policies for travel cost reduction. Most existing studies on parking fall short in reproducing the dynamic spatiotemporal features of traffic congestion in general, lack the treatment of dynamics of the cruising-for-parking phenomenon, or require detailed input data that are typically costly and difficult to collect. In this paper, we propose an aggregated and dynamic approach for modeling multimodal traffic with the treatment on parking, and utilize the approach to design dynamic parking pricing strategies. The proposed approach is based on the Macroscopic Fundamental Diagram (MFD), which can capture congestion dynamics at network-level for single-mode and bi-modal (car and bus) systems. A parsimonious parking model is integrated into the MFD-based multimodal modeling framework, where the dynamics of vehicular and passenger flows are considered with a change in the aggregated behavior (e.g. mode choice and parking facility choice) caused by cruising and congestion. Pricing strategies are developed with the objective of reducing congestion, as well as lowering the total travel cost of all users. A case study is carried out for a bi-modal city network with a congested downtown region. An elegant feedback dynamic parking pricing strategy can effectively reduce travel delay of cruising and the generic congestion. Remarkably, such strategy, which is applicable in real-time management with limited available data, is fairly as efficient as a dynamic pricing scheme obtained from system optimum conditions and a global optimization with full information about the future states of the system. Stackelberg equilibrium is also investigated in a competitive behavior between different parking facility operators. Policy indications on on-street storage capacity management and pricing are provided.     

Application of optimal subset selection to problems of design and scheduling in urban transportation networks

The paper describes some possibilities for modifying the optimal network algorithm developed by Boyce, Farhi and Weischedel in a way that makes it applicable to some practical problems of network planning. The modifications, which have been tested with respect to their effect on the efficiency of the algorithm, include the introduction of asymmetrical demand structures, the integration of an existing network, the lexico-minimization of a dynamic objective function, and the consideration of constraints related to interdependencies between candidate links. Two small network problems and one medium-sized problem (61 nodes, 104 links, 16 candidates) have been computed; the results support the hypothesis that the algorithm may be applied to produce approximate solutions to problems of practical dimensions within a reasonable range of time.