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.     

Speed variation during peak and off-peak hours on urban arterials in Shanghai

Increased speed variation on urban arterials is associated with reductions in both operational performance and safety. Traffic flow, mean speed, traffic control parameters and geometric design features are known to affect speed variation. An exploratory study of the relationships among these variables could provide a foundation for improving the operational and safety performance of urban arterials, however, such a study has been hampered by problems in measuring speeds. The measurement of speed has traditionally been accomplished using spot speed collection methods such as radar, laser and loop detectors. These methods can cover only limited locations, and consequently are not able to capture speed distributions along an entire network, or even throughout any single road segment. In Shanghai, it is possible to acquire the speed distribution of any roadway segment, over any period of interest, by capturing data from Shanghai’s 50,000+ taxis equipped with Global Positional Systems (GPS). These data, hereafter called Floating Car Data, were used to calculate mean speed and speed variation on 234 road segments from eight urban arterials in downtown Shanghai. Hierarchical models with random variables were developed to account for spatial correlations among segments within each arterial and heterogeneities among arterials. Considering that traffic demand changes throughout the day, AM peak, Noon off-peak, and PM peak hours were studied separately. Results showed that increases in number of lanes and number of access points, the presence of bus stops and increases in mean speed were all associated with increased speed variation, and that increases in traffic volume and traffic signal green times were associated with reduced speed variation. These findings can be used by engineers to minimize speed differences during the road network planning stage and continuing through the traffic management phase.     

Inferring origin–destination trip matrices from aggregate volumes on groups of links: a case study using volumes inferred from mobile phone data

The origin–destination matrix is an important source of information describing transport demand in a region. Most commonly used methods for matrix estimation use link volumes collected on a subset of links in order to update an existing matrix. Traditional volume data collection methods have significant shortcomings because of the high costs involved and the fact that detectors only provide status information at specified locations in the network. Better matrix estimates can be obtained when information is available about the overall distribution of traffic through time and space. Other existing technologies are not used in matrix estimation methods because they collect volume data aggregated on groups of links, rather than on single links. That is the case of mobile systems. Mobile phones sometimes cannot provide location accuracy for estimating flows on single links but do so on groups of links; in contrast, data can be acquired over a wider coverage without additional costs. This paper presents a methodology adapted to the concept of volume aggregated on groups of links in order to use any available volume data source in traditional matrix estimation methodologies. To calculate volume data, we have used a model that has had promising results in transforming phone call data into traffic movement data. The proposed methodology using vehicle volumes obtained by such a model is applied over a large real network as a case study. The experimental results reveal the efficiency and consistency of the solution proposed, making the alternative attractive for practical applications. Copyright © 2011 John Wiley & Sons, Ltd.     

Urban traffic state estimation: Fusing point and zone based data

Loop detectors are the oldest and widely used traffic data source. On urban arterials, they are mainly installed for signal control. Recently state-of-the art Bluetooth MAC Scanners (BMS) has significantly captured the interest of stakeholders for exploiting it for area-wide traffic monitoring. Loop detectors provide flow – a fundamental traffic parameter; whereas BMS provides individual vehicle travel time between BMS stations. Hence, these two data sources complement each other, and if integrated should increase the accuracy and reliability of the traffic state estimation.This paper proposed a model that integrates loops and BMS data for seamless travel time and density estimation for urban signalised network. The proposed model is validated using both real and simulated data and the results indicate that the accuracy of the proposed model is over 90%.     

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.     

Deriving macroscopic fundamental diagrams from probe data: Issues and proposed solutions

Well-defined relationships between flow and density averaged spatially across urban traffic networks, more commonly known as Macroscopic Fundamental Diagrams (MFDs), have been recently verified to exist in reality. Researchers have proposed using MFDs to monitor the status of urban traffic networks and to inform the design of network-wide traffic control strategies. However, it is also well known that empirical MFDs are not easy to estimate in practice due to difficulties in obtaining the requisite data needed to construct them. Recent works have devised ways to estimate a network’s MFD using limited trajectory data that can be obtained from GPS-equipped mobile probe vehicles. These methods assume that the market penetration level of mobile probe vehicles is uniform across the entire set of OD pairs in the network; however, in reality the probe vehicle market penetration rate varies regionally within a network. When this variation is combined with the imbalance of probe trip lengths and travel times, the compound effects will further complicate the estimation of the MFD.To overcome this deficit, we propose a method to estimate a network’s MFD using mobile probe data when the market penetration rates are not necessarily the same across an entire network. This method relies on the determination of appropriate average probe penetration rates, which are weighted harmonic means using individual probe vehicle travel times and distances as the weights. The accuracy of this method is tested using synthetic data generated in the INTEGRATION micro-simulation environment by comparing the estimated MFDs to the ground truth MFD obtained using a 100% market penetration of probe vehicles. The results show that the weighted harmonic mean probe penetration rates outperform simple (arithmetic) average probe penetration rates, as expected. This especially holds true as the imbalance of demand and penetration level increases. Furthermore, as the probe penetration rates are generally not known, an algorithm to estimate the probe penetration rates of regional OD pairs is proposed. This algorithm links count data from sporadic fixed detectors in the network to information from probe vehicles that pass the detectors. The simulation results indicate that the proposed algorithm is very effective. Since the data needed to apply this algorithm are readily available and easy to collect, the proposed algorithm is practically feasible and offers a better approach for the estimation of the MFD using mobile probe data, which are becoming increasingly available in urban environments.     

Vehicle reidentification and travel time measurement across freeway junctions using the existing detector infrastructure

Conventional vehicle detectors are capable of monitoring discrete points along the freeway but do not provide information about conditions on the link between detectors. Knowledge of conditions on the link is useful to operating agencies for enabling timely decisions in response to various delay causing events and hence to reduce the resulting congestion of the freeway system. This paper presents an approach that matches vehicle measurements between detector stations to provide information on the conditions over the link between the detectors rather than relying strictly on the aggregate point measurements from the detectors. In particular this work reidentifies measurements from distinct vehicles using the existing loop detector infrastructure. Here the distinct vehicles are the long vehicles, but depending on the vehicle population or type of detector used, one might chose to use some other reproducible feature.This new methodology represents an important advancement over preceding loop based vehicle reidentification, as illustrated herein, it enables vehicle reidentification across a major diverge and a major merge. The examples include a case where the reidentification algorithm responded to delay between two detector stations an hour before the delay was locally observable at either of the stations used for reidentification. While previous loop based reidentification work was limited to dual loop detectors, the present effort also extends the methodology to single loop detectors; thereby making it more widely applicable. Although the research uses loop detector data, the algorithm would be equally applicable to data obtained from many other traffic detectors that provide reproducible vehicle features.     

Real-time traffic state estimation in urban corridors from heterogeneous data

In recent years, rapid advances in information technology have led to various data collection systems which are enriching the sources of empirical data for use in transport systems. Currently, traffic data are collected through various sensors including loop detectors, probe vehicles, cell-phones, Bluetooth, video cameras, remote sensing and public transport smart cards. It has been argued that combining the complementary information from multiple sources will generally result in better accuracy, increased robustness and reduced ambiguity. Despite the fact that there have been substantial advances in data assimilation techniques to reconstruct and predict the traffic state from multiple data sources, such methods are generally data-driven and do not fully utilize the power of traffic models. Furthermore, the existing methods are still limited to freeway networks and are not yet applicable in the urban context due to the enhanced complexity of the flow behavior. The main traffic phenomena on urban links are generally caused by the boundary conditions at intersections, un-signalized or signalized, at which the switching of the traffic lights and the turning maneuvers of the road users lead to shock-wave phenomena that propagate upstream of the intersections. This paper develops a new model-based methodology to build up a real-time traffic prediction model for arterial corridors using data from multiple sources, particularly from loop detectors and partial observations from Bluetooth and GPS devices.     

Existence of urban-scale macroscopic fundamental diagrams: Some experimental findings

A field experiment in Yokohama (Japan) reveals that a macroscopic fundamental diagram (MFD) linking space-mean flow, density and speed exists on a large urban area. The experiment used a combination of fixed detectors and floating vehicle probes as sensors. It was observed that when the somewhat chaotic scatter-plots of speed vs. density from individual fixed detectors were aggregated the scatter nearly disappeared and points grouped neatly along a smoothly declining curve. This evidence suggests, but does not prove, that an MFD exists for the complete network because the fixed detectors only measure conditions in their proximity, which may not represent the whole network. Therefore, the analysis was enriched with data from GPS-equipped taxis, which covered the entire network. The new data were filtered to ensure that only full-taxi trips (i.e., representative of automobile trips) were retained in the sample. The space-mean speeds and densities at different times-of-day were then estimated for the whole study area using relevant parts of the detector and taxi data sets. These estimates were still found to lie close to a smoothly declining curve with deviations smaller than those of individual links – and entirely explained by experimental error. The analysis also revealed a fixed relation between the space-mean flows on the whole network, which are easy to estimate given the existence of an MFD, and the trip completion rates, which dynamically measure accessibility.     

On the use of Lagrangian observations from public transport and probe vehicles to estimate car space-mean speeds in bi-modal urban networks

The Macroscopic Fundamental Diagram (MFD) has been recognized as a powerful framework to develop network-wide control strategies. Recently, the concept has been extended to the three-dimensional MFD, used to investigate traffic dynamics of multi-modal urban cities, where different transport modes compete for, and share the limited road infrastructure. In most cases, the macroscopic traffic variables are estimated using either loop detector data (LDD) or floating car data (FCD). Taking into account that none of these data sources might be available, in this study we propose novel estimation methods for the space-mean speed of cars based on: (i) the automatic vehicle location (AVL) data of public transport where no FCD is available; and (ii) the fused FCD and AVL data sources where both are available, but FCD is not complete. Both methods account for the network configuration layout and the configuration of the public transport system. The first method allows one to derive either uni-modal or bi-modal macroscopic fundamental relationships, even in the extreme cases where no LDD nor FCD exist. The second method does not require a priori knowledge about FCD penetration rates and can significantly improve the estimation accuracy of the macroscopic fundamental relationships. Using empirical data from the city of Zurich, we demonstrate the applicability and validate the accuracy of the proposed methods in real-life traffic scenarios, providing a cross-comparison with the existing estimation methods. Such empirical comparison is, to the best of our knowledge, the first of its kind. The findings show that the proposed AVL-based estimation method can provide a good approximation of the average speed of cars at the network level. On the other hand, by fusing the FCD and AVL data, especially in case of sparse FCD, it is possible to obtain a more representative outcome regarding the performance of multi-modal traffic.     

A mixed-integer linear program for optimizing sensor locations along freeway corridors

How to optimally allocate limited freeway sensor resources is of great interest to transportation engineers. In this paper, we focus on the optimal allocation of point sensors, such as loop detectors, to minimize performance measurement errors. Although it has been shown that the minimization problem can be intuitively formulated as a nonlinear program, the formulation is so complex that only heuristic approaches can be used to solve the problem. In this paper, we transform the nonlinear program into an equivalent mixed-integer linear model. The linearized model is shown to have a graphical interpretation and can be solved using resource constrained shortest path algorithms. A customized Branch-and-Bound technique is then proposed to solve the resource constrained shortest path problem. Numerical experiments along an urban freeway corridor demonstrate that this sensor location model is successful in allocating loop detectors to improve the accuracy of travel time estimation.     

Real-time estimation of turning movement counts at signalized intersections using signal phase information

A variety of sensor technologies, such as loop detectors, traffic cameras, and radar have been developed for real-time traffic monitoring at intersections most of which are limited to providing link traffic information with few being capable of detecting turning movements. Accurate real-time information on turning movement counts at signalized intersections is a critical requirement for applications such as adaptive traffic signal control. Several attempts have been made in the past to develop algorithms for inferring turning movements at intersections from entry and exit counts; however, the estimation quality of these algorithms varies considerably. This paper introduces a method to improve accuracy and robustness of turning movement estimation at signalized intersections. The new algorithm makes use of signal phase status to minimize the underlying estimation ambiguity. A case study was conducted based on turning movement data obtained from a four-leg signalized intersection to evaluate the performance of the proposed method and compare it with two other existing well-known estimation methods. The results show that the algorithm is accurate, robust and fairly straightforward for real world implementation.     

Optimal speed detector density for the network with travel time information

In the expressway network, detectors are installed on the links for detecting the travel time information while the predicted travel time can be provided by the route guidance system (RGS). The speed detector density can be determined to influence flow distributions in such a way that the precision of the travel time information and the social cost of the speed detectors are optimized, provided that each driver chooses the minimum perceived travel time path in response to the predicted travel time information. In this paper, a bilevel programming model is proposed for the network with travel time information provided by the RGS. The lower-level problem is a probit-based traffic assignment model, while the upper-level problem is to determine the speed detector density that minimizes the measured travel time error variance as well as the social cost of the speed detectors. The sensitivity analysis based algorithm is proposed for the bilevel programming problem. Numerical examples are provided to illustrate the applications of the proposed model and of the solution algorithm.     

A recursive, cell processing model for predicting freeway travel times

Travel time information influences driver behaviour and can contribute to reducing congestion and improving network efficiency. Consequently many road authorities disseminate travel time information on road side signs, web sites and radio traffic broadcasts. Operational systems commonly rely on speed data obtained from inductive loop detectors and estimate travel times using simple algorithms that are known to provide poor predictions particularly on either side of the peak period. This paper presents a new macroscopic model for predicting freeway travel times which overcomes the limitations of operational ‘instantaneous’ speed models by drawing on queuing theory to model the processing of vehicles in sections or cells of the freeway. The model draws on real-time speed, flow and occupancy data and is formulated to accommodate varying geometric conditions, the relative distribution of vehicles along the freeway, variations in speed limits, the impact of ramp flows and fixed or transient bottlenecks. Field validation of the new algorithm was undertaken using data from two operational freeways in Melbourne, Australia. Consistent with the results of simulation testing, the validation confirmed that the recursive model provided a substantial improvement in travel time predictions when compared to the model currently used to provide real-time travel time information to motorists in Melbourne.     

Practical approach for travel time estimation from point traffic detector data

Accurate estimation of travel time is critical to the success of advanced traffic management systems and advanced traveler information systems. Travel time estimation also provides basic data support for travel time reliability research, which is being recognized as an important performance measure of the transportation system. This paper investigates a number of methods to address the three major issues associated with travel time estimation from point traffic detector data: data filling for missing or error data, speed transformation from time‐mean speed to space‐mean speed, and travel time estimation that converts the speeds recorded at detector locations to travel time along the highway segment. The case study results show that the spatial and temporal interpolation of missing data and the transformation to space‐mean speed improve the accuracy of the estimates of travel time. The results also indicate that the piecewise constant‐acceleration‐based method developed in this study and the average speed method produce better results than the other three methods proposed in previous studies. Copyright © 2011 John Wiley & Sons, Ltd.     

Speed estimation and length based vehicle classification from freeway single-loop detectors

Roadway usage, particularly by large vehicles, is one of the fundamental factors determining the lifespan of highway infrastructure. Operating agencies typically employ expensive classification stations to monitor large vehicle usage. Meanwhile, single-loop detectors are the most common vehicle detector and many new, out-of-pavement detectors seek to replace loop detectors by emulating the operation of single-loop detectors. In either case, collecting reliable length data from these detectors has been considered impossible due to the noisy speed estimates provided by conventional data aggregation at single-loop detectors. This research refines non-conventional techniques for estimating speed at single-loop detectors, yielding estimates that approach the accuracy of a dual-loop detector’s measurements. Employing these speed estimation advances, this research brings length based vehicle classification to single-loop detectors (and by extension, many of the emerging out-of-pavement detectors). The classification methodology is evaluated against concurrent measurements from video and dual-loop detectors. To capture higher truck volumes than empirically observed, a process of generating synthetic detector actuations is developed. By extending vehicle classification to single-loop detectors, this work leverages the existing investment deployed in single-loop detector count stations and real-time traffic management stations. The work also offers a viable treatment in the event that one of the loops in a dual-loop detector classification station fails and thus, also promises to improve the reliability of existing classification stations.     

A microscopic analysis of speed deviation impacts on lane-changing behavior

Driving behavior models that capture drivers’ tactical maneuvering decisions in different traffic conditions are essential to microscopic traffic simulation systems. This paper focuses on a parameter that has a great impact on road users’ aggressive overtaking maneuvers and directly affects lane-changing models (an integral part of microscopic traffic simulation models), namely, speed deviation. The objective of this research is to investigate the impacts of speed deviation in terms of performance measures (delay time, network mean speed, and travel time duration) and the number of lane-change maneuvers using the Aimsun traffic simulator. Following calibration of the model for a section of urban highway in Tehran, this paper explores the sensitivity of lane-changing maneuvers during different speed deviations by conducting two types of test. Simulation results show that, by decreasing speed deviation, the number of lane changes reduces remarkably and so network safety increases, thus reducing travel time due to an increase in network mean speed.     

A traffic congestion detection and information dissemination scheme for urban expressways using vehicular networks

The cooperative vehicle-infrastructure technologies have enabled vehicles to collect and exchange traffic information in real time. Therefore, it is possible to use Vehicular Ad-hoc NETworks (VANETs) for detecting traffic congestion on urban expressways. However, because of the special topology of urban expressways (consisting of both major and auxiliary roadways), the existing traffic congestion detection methods using VANETs do not work very well. In addition, the existing dissemination methods of congestion information lack the necessary control mechanism, so the information may be disseminated to irrelevant geographical areas. This paper proposes a congestion detection and notification scheme using VANETs for urban expressways. The scheme adopts a simplified Doppler frequency shift method to estimate and differentiate traffic conditions for major and auxiliary roadways. Vehicular cooperation and human cognition are introduced to improve the estimation accuracy and to describe the overall traffic conditions. Additionally, the scheme develops a spatial–temporal effectiveness model based on the potential energy theory to control the dissemination area and survival time of the congestion information. Meanwhile, the proposed scheme uses several broadcast control mechanisms to alleviate vehicular network congestion. Simulations through TransModeler indicate that our scheme ensures the accuracy of the estimation of congestion degree. Consequently, the scheme can provide effective references for driving decision-making and path-planning.     

Evaluation of a cellular phone-based system for measurements of traffic speeds and travel times: A case study from Israel

The purpose of this paper is to examine the performance of a new operational system for measuring traffic speeds and travel times which is based on information from a cellular phone service provider. Cellular measurements are compared with those obtained by dual magnetic loop detectors. The comparison uses data for a busy 14 km freeway with 10 interchanges, in both directions, during January–March of 2005. The dataset contains 1 284 587 valid loop detector speed measurements and 440 331 valid measurements from the cellular system, each measurement referring to a 5 min interval. During one week in this period, 25 floating car measurements were conducted as additional comparison observations. The analyses include visual, graphical, and statistical techniques; focusing in particular on comparisons of speed patterns in the time–space domain. The main finding is that there is a good match between the two measurement methods, indicating that the cellular phone-based system can be useful for various practical applications such as advanced traveler information systems and evaluating system performance for modeling and planning.     

Modeling measurement errors and missing initial values in freeway dynamic origin–destination estimation systems

Most existing dynamic origin–destination (O–D) estimation approaches are grounded on the assumption that a reliable initial O–D set is available and traffic volume data from detectors are accurate. However, in most traffic systems, both types of critical information are either not available or subjected to some level of measurement errors such as traffic counts and speed measurement from sensors. To contend with those critical issues, this study presents two robust algorithms, one for estimation of an initial O–D set and the other for tackling the input measurement errors with an extended estimation algorithm. The core concept of the initial O–D estimation algorithm is to decompose the target network in a number of sub-networks based on proposed rules, and then execute the estimation of the initial O–D set iteratively with the observable information at the first time interval. To contend with the inevitable detector measurement error, this study proposes an interval-based estimation algorithm that converts each model input data as an interval with its boundaries being set based on some prior knowledge. The performance of both proposed algorithms has been tested with a simulated system, the I-95 freeway corridor between I-495 and I-695, and the results are quite promising.