Length-based vehicle classification using event-based loop detector data

Length-based vehicle classification is an important topic in traffic engineering, because estimation of traffic speed from single loop detectors usually requires the knowledge of vehicle length. In this paper, we present an algorithm that can classify vehicles passing by a loop detector into two categories: long vehicles and regular cars. The proposed algorithm takes advantage of event-based loop detector data that contains every vehicle detector actuation and de-actuation “event”, therefore time gaps between consecutive vehicles and detector occupation time for each vehicle can be easily derived. The proposed algorithm is based on an intuitive observation that, for a vehicle platoon, longer vehicles in the platoon will have relatively longer detector occupation time. Therefore, we can identify longer vehicles by examining the changes of occupation time in a vehicle platoon. The method was tested using the event-based data collected from Trunk Highway 55 in Minnesota, which is a high speed arterial corridor controlled by semi-actuated coordinated traffic signals. The result shows that the proposed method can correctly classify most of the vehicles passing by a single loop detector.     

Using high-resolution event-based data for traffic modeling and control: An overview

Research on using high-resolution event-based data for traffic modeling and control is still at early stage. In this paper, we provide a comprehensive overview on what has been achieved and also think ahead on what can be achieved in the future. It is our opinion that using high-resolution event data, instead of conventional aggregate data, could bring significant improvements to current research and practices in traffic engineering. Event data records the times when a vehicle arrives at and departs from a vehicle detector. From that, individual vehicle’s on-detector-time and time gap between two consecutive vehicles can be derived. Such detailed information is of great importance for traffic modeling and control. As reviewed in this paper, current research has demonstrated that event data are extremely helpful in the fields of detector error diagnosis, vehicle classification, freeway travel time estimation, arterial performance measure, signal control optimization, traffic safety, traffic flow theory, and environmental studies. In addition, the cost of event data collection is low compared to other data collection techniques since event data can be directly collected from existing controller cabinet without any changes on the infrastructure, and can be continuously collected in 24/7 mode. This brings many research opportunities as suggested in the paper.     

Real-time queue length estimation for congested signalized intersections

How to estimate queue length in real-time at signalized intersection is a long-standing problem. The problem gets even more difficult when signal links are congested. The traditional input–output approach for queue length estimation can only handle queues that are shorter than the distance between vehicle detector and intersection stop line, because cumulative vehicle count for arrival traffic is not available once the detector is occupied by the queue. In this paper, instead of counting arrival traffic flow in the current signal cycle, we solve the problem of measuring intersection queue length by exploiting the queue discharge process in the immediate past cycle. Using high-resolution “event-based” traffic signal data, and applying Lighthill–Whitham–Richards (LWR) shockwave theory, we are able to identify traffic state changes that distinguish queue discharge flow from upstream arrival traffic. Therefore, our approach can estimate time-dependent queue length even when the signal links are congested with long queues. Variations of the queue length estimation model are also presented when “event-based” data is not available. Our models are evaluated by comparing the estimated maximum queue length with the ground truth data observed from the field. Evaluation results demonstrate that the proposed models can estimate long queues with satisfactory accuracy. Limitations of the proposed model are also discussed in the paper.     

Reconstructing maximum likelihood trajectory of probe vehicles between sparse updates

Data from connected probe vehicles can be critical in estimating road traffic conditions. Unfortunately, current available data is usually sparse due to the low reporting frequency and the low penetration rate of probe vehicles. To help fill the gaps in data, this paper presents an approach for estimating the maximum likelihood trajectory (MLT) of a probe vehicle in between two data updates on arterial roads. A public data feed from transit buses in the city of San Francisco is used as an example data source. Low frequency updates (at every 200 m or 90 s) leaves much to be inferred. We first estimate travel time statistics along the road and queue patterns at intersections from historical probe data. The path is divided into short segments, and an Expectation Maximization (EM) algorithm is proposed for allocating travel time statistics to each segment. Then the trajectory with the maximum likelihood is generated based on segment travel time statistics. The results are compared with high frequency ground truth data in multiple scenarios, which demonstrate the effectiveness of the proposed approach, in estimating both the trajectory while moving and the stop positions and durations at intersections.     

Arterial travel time estimation based on vehicle re-identification using wireless magnetic sensors

A practical system is described for the real-time estimation of travel time across an arterial segment with multiple intersections. The system relies on matching vehicle signatures from wireless sensors. The sensors provide a noisy magnetic signature of a vehicle and the precise time when it crosses the sensors. A match (re-identification) of signatures at two locations gives the corresponding travel time of the vehicle. The travel times for all matched vehicles yield the travel time distribution. Matching results can be processed to provide other important arterial performance measures including capacity, volume/capacity ratio, queue lengths, and number of vehicles in the link. The matching algorithm is based on a statistical model of the signatures. The statistical model itself is estimated from the data, and does not require measurement of ‘ground truth’. The procedure does not require measurements of signal settings; in fact, signal settings can be inferred from the matched vehicle results. The procedure is tested on a 1.5 km (0.9 mile)-long segment of San Pablo Avenue in Albany, CA, under different traffic conditions. The segment is divided into three links: one link spans four intersections, and two links each span one intersection.     

Analysis of yellow-light running at signalized intersections using high-resolution traffic data

Many accidents occurring at signalized intersections are closely related to drivers’ decisions of running through intersections during yellow light, i.e., yellow-light running (YLR). Therefore it is important to understand the relationships between YLR and the factors which contribute to drivers’ decision of YLR. This requires collecting a large amount of YLR cases. However, existing data collection method, which mainly relies on video cameras, has difficulties to collect a large amount of YLR data. In this research, we propose a method to study drivers’ YLR behaviors using high-resolution event-based data from signal control systems. We used 8 months’ high-resolution data collected by two stop-bar detectors at a signalized intersection located in Minnesota and identified over 30,000 YLR cases. To identify the possible reasons for drivers’ decision of YLR, this research further categorized the YLR cases into four types: “in should-go zone”, “in should-stop zone”, “in dilemma zone”, and “in optional zone” according to the driver’s location when signal turns to yellow. Statistical analysis indicates that the mean values of approaching speed and acceleration rate are significantly different for different types of YLR. We also show that there were about 10% of YLR drivers who cannot run through intersection before traffic light turns to red. Furthermore, based on a strong correlation between hourly traffic volume and number of YLR events, this research developed a regression model that can be used to predict the number of YLR events based on hourly flow rate. This research also showed that snowing weather conditions cause more YLR events.     

Probe vehicle based real-time traffic monitoring on urban roadways

Travel time estimation and prediction on urban arterials is an important component of Active Traffic and Demand Management Systems (ATDMS). This paper aims in using the information of GPS probes to augment less dynamic but available information describing arterial travel times. The direction followed in this paper chooses a cooperative approach in travel time estimation using static information describing arterial geometry and signal timing, semi-dynamic information of historical travel time distributions per time of day, and utilizes GPS probe information to augment and improve the latter. First, arterial travel times are classified by identifying different travel time states, then link travel time distributions are approximated using mixtures of normal distributions. If prior travel time data is available, travel time distributions can be estimated empirically. Otherwise, travel time distribution can be estimated based on signal timing and arterial geometry. Real-time GPS travel time data is then used to identify the current traffic condition based on Bayes Theorem. Moreover, these GPS data can also be used to update the parameters of the travel time distributions using a Bayesian update. The iterative update process makes the posterior distributions more and more accurate. Finally, two comprehensive case studies using the NGSIM Peachtree Street dataset, and GPS data of Washington Avenue in Minneapolis, were conducted. The first case study estimated prior travel time distributions based on signal timing and arterial geometry under different traffic conditions. Travel time data were classified and corresponding distributions were updated. In addition, results from the Bayesian update and EM algorithm were compared. The second case study first tested the methodologies based on real GPS data and showed the importance of sample size. In addition, a methodology was proposed to distinguish new traffic conditions in the second case study.     

The development of taiwan arterial traffic‐adaptive signal control system and its field test: A taiwan experience

This Taiwan traffic‐adaptive arterial signal control model borrowed its traffic flow framework mainly from a British traffic‐adaptive control model with a cyclic traffic progression function, i.e. SCOOT (Split Cycle Office Optimisation Technique). The new arterial control model can take into account delays of both major and minor streets and make real‐time signal timing decisions with optimal two‐way signal offsets, so as to create the best arterial signal operation performance. It has been developed to be an online real‐time software for both simulation testing and field validation. Through simulation, it was found that the performance when operating this newly developed real‐time arterial traffic‐adaptive model was significantly better than when using the optimal fixed‐time arterial timing plan. On the aspect of field testing, three signalized intersections located in East District, Tainan City, Taiwan were selected to be the test sites. Fairly good traffic control performance has been demonstrated in that it can effectively reduce travel delays of the control arterial as a whole. Additional discussions about how to combine travel delay and the total number of vehicle stops into a new control performance index have also been included to make the new traffic‐adaptive model more flexible and reasonable to meet the expectations of different driver groups in the arterial system.     

Probe vehicle data sampled by time or space: Consistent travel time allocation and estimation

A characteristic of low frequency probe vehicle data is that vehicles traverse multiple network components (e.g., links) between consecutive position samplings, creating challenges for (i) the allocation of the measured travel time to the traversed components, and (ii) the consistent estimation of component travel time distribution parameters. This paper shows that the solution to these problems depends on whether sampling is based on time (e.g., one report every minute) or space (e.g., one every 500 m). For the special case of segments with uniform space-mean speeds, explicit formulae are derived under both sampling principles for the likelihood of the measurements and the allocation of travel time. It is shown that time-based sampling is biased towards measurements where a disproportionally long time is spent on the last segment. Numerical experiments show that an incorrect likelihood formulation can lead to significantly biased parameter estimates depending on the shapes of the travel time distributions. The analysis reveals that the sampling protocol needs to be considered in travel time estimation using probe vehicle data.     

Reducing bias in probe-based arterial link travel time estimates

The use of probe vehicles to provide estimates of link travel times has been suggested as a means of obtaining travel times within signalized networks for use in advanced traveler information systems. Previous research has shown that bias in arrival time distributions of probe vehicles will lead to a systematic bias in the sample estimate of the mean. This paper proposes a methodology for reducing the effect of this bias. The method, based on stratified sampling techniques, requires that vehicle count data be obtained from an in-road loop detector or other traffic surveillance method. The effectiveness of the methodology is illustrated using simulation results for a single intersection approach and for an arterial corridor. The results for the single intersection approach indicate a correlation (R²) between the biased estimate and the population mean of 0.61, and an improved correlation between the proposed estimation method and the population mean of 0.81. Application of the proposed method to the arterial corridor resulted in a reduction in the mean travel time error of approximately 50%, further indicating that the proposed estimation method provides improved accuracy over the typical method of computing the arithmetic mean of the probe reports.     

Estimating traffic volumes for signalized intersections using connected vehicle data

Recently connected vehicle (CV) technology has received significant attention thanks to active pilot deployments supported by the US Department of Transportation (USDOT). At signalized intersections, CVs may serve as mobile sensors, providing opportunities of reducing dependencies on conventional vehicle detectors for signal operation. However, most of the existing studies mainly focus on scenarios that penetration rates of CVs reach certain level, e.g., 25%, which may not be feasible in the near future. How to utilize data from a small number of CVs to improve traffic signal operation remains an open question. In this work, we develop an approach to estimate traffic volume, a key input to many signal optimization algorithms, using GPS trajectory data from CV or navigation devices under low market penetration rates. To estimate traffic volumes, we model vehicle arrivals at signalized intersections as a time-dependent Poisson process, which can account for signal coordination. The estimation problem is formulated as a maximum likelihood problem given multiple observed trajectories from CVs approaching to the intersection. An expectation maximization (EM) procedure is derived to solve the estimation problem. Two case studies were conducted to validate our estimation algorithm. One uses the CV data from the Safety Pilot Model Deployment (SPMD) project, in which around 2800 CVs were deployed in the City of Ann Arbor, MI. The other uses vehicle trajectory data from users of a commercial navigation service in China. Mean absolute percentage error (MAPE) of the estimation is found to be 9–12%, based on benchmark data manually collected and data from loop detectors. Considering the existing scale of CV deployments, the proposed approach could be of significant help to traffic management agencies for evaluating and operating traffic signals, paving the way of using CVs for detector-free signal operation in the future.     

Optimal distance between two branches of uncontrolled split intersection

This work examines the possibility of splitting an uncontrolled “X” intersection into two adjacent uncontrolled “T” intersections. This splitting aims to improve both the movement and safety of traffic. The problem addressed in this work is how to determine the optimal distance between the two adjacent T intersections. The best type of split, based on previous studies, is the one in which vehicles approach first the right turn and then the left turn in both directions of travel. The main conclusions drawn in this work refer to this preferred type. The optimal distance is arrived at on the basis of an objective function of minimal delay subject to blocking queues, passing (another vehicle) probabilities, budget limitations and safety threshold. The input data consist of 12 traffic volumes associated with all the traffic movements of an X intersection. The main findings are: (a) under a medium level of traffic volume, the blocking queue lengths are of the order of hundreds of meters and are very sensitive to the increase of volume toward and beyond saturation flow; (b) the passing probability function along the road segment between the two adjacent T intersections increases with the length of the segment and stabilizes at a length of a few hundred meters; (c) there is a relationship between accident frequency (accident rate and density) and the distance between the split intersections. An example of this relationship is introduced; and (d) the optimal distance between the two adjacent T intersections is found not only theoretically, but also practically for possible implementations.     

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.     

A continuous-flow-intersection-lite design and traffic control for oversaturated bottleneck intersections

Oversaturation has become a severe problem for urban intersections, especially the bottleneck intersections that cause queue spillover and network gridlock. Further improvement of oversaturated arterial traffic using traditional mitigation strategies, which aim to improve intersection capacity by merely adjusting signal control parameters, becomes challenging since exiting strategies may (or already) have reached their “theoretical” limits of optimum. Under such circumstance, several novel unconventional intersection designs, including the well-recognized continuous flow intersection (CFI) design, are originated to improve the capacity at bottleneck intersections. However, the requirement of installing extra sub-intersections in a CFI design would increase vehicular stops and, more critically, is unacceptable in tight urban areas with closed spaced intersections. To address these issues, this research proposes a simplified continuous flow intersection (called CFI-Lite) design that is ideal for arterials with short links. It benefits from the CFI concept to enable simultaneous move of left-turn and through traffic at bottleneck intersections, but does not need installation of sub-intersections. Instead, the upstream intersection is utilized to allocate left-turn traffic to the displaced left-turn lane. It is found that the CFI-Lite design performs superiorly to the conventional design and regular CFI design in terms of bottleneck capacity. Pareto capacity improvement for every traffic stream in an arterial system can be achieved under effortless conditions. Case study using data collected at Foothill Blvd in Los Angeles, CA, shows that the new design is beneficial in more than 90% of the 408 studied cycles. The testing also shows that the average improvements of green bandwidths for the synchronized phases are significant.     

Accuracy of distance‐based travel time decomposition in probe vehicle systems

Probe vehicle data (PVD) are commonly used for area‐wide measurements of travel time in road networks. In this context, travel times usually refer to fixed edges of an underlying (digital) map. That means measured travel times have to be transformed into so‐called link travel times first. This paper analyzes a common method being applied for solving this task (distance‐based travel time decomposition). It is shown that, in general, its inherent imprecision must not be neglected. Instead, it might cause a serious misinterpretation of data if potential errors in the context of travel time decomposition are ignored. For this purpose, systematic as well as maximum deviations between “decomposed” and “true” link travel times are mathematically analyzed. By that, divergent statements in the literature about the accuracy of PVD are harmonized. Moreover, conditions for the applicability of the so‐called distance‐proportion method are derived depending on the permitted error level. Three examples ranging from pure theory to real world confirm the analytical findings and underline the problems resulting from distance‐based travel time decomposition at local level, for example, at individual intersections. Copyright © 2013 John Wiley & Sons, Ltd.     

Siting public electric vehicle charging stations in Beijing using big-data informed travel patterns of the taxi fleet

Charging infrastructure is critical to the development of electric vehicle (EV) system. While many countries have implemented great policy efforts to promote EVs, how to build charging infrastructure to maximize overall travel electrification given how people travel has not been well studied. Mismatch of demand and infrastructure can lead to under-utilized charging stations, wasting public resources. Estimating charging demand has been challenging due to lack of realistic vehicle travel data. Public charging is different from refueling from two aspects: required time and home-charging possibility. As a result, traditional approaches for refueling demand estimation (e.g. traffic flow and vehicle ownership density) do not necessarily represent public charging demand. This research uses large-scale trajectory data of 11,880 taxis in Beijing as a case study to evaluate how travel patterns mined from big-data can inform public charging infrastructure development. Although this study assumes charging stations to be dedicated to a fleet of PHEV taxis which may not fully represent the real-world situation, the methodological framework can be used to analyze private vehicle trajectory data as well to improve our understanding of charging demand for electrified private fleet. Our results show that (1) collective vehicle parking “hotspots” are good indicators for charging demand; (2) charging stations sited using travel patterns can improve electrification rate and reduce gasoline consumption; (3) with current grid mix, emissions of CO₂, PM, SO₂, and NO_x will increase with taxi electrification; and (4) power demand for public taxi charging has peak load around noon, overlapping with Beijing’s summer peak power.     

The estimation of a time-dependent OD trip table with vehicle trajectory samples

Abstract

In this paper we discuss a dynamic origin–destination (OD) estimation problem that has been used for identifying time-dependent travel demand on a road network. Even though a dynamic OD table is an indispensable data input for executing a dynamic traffic assignment, it is difficult to construct using the conventional OD construction method such as the four-step model. For this reason, a direct estimation method based on field traffic data such as link traffic counts has been used. However, the method does not account for a logical relationship between a travel demand pattern and socioeconomic attributes. In addition, the OD estimation method cannot guarantee the reliability of estimated results since the OD estimation problem has a property named the ‘underdetermined problem.’ In order to overcome such a problem, the method developed in this paper makes use of vehicle trajectory samples with link traffic counts. The new method is applied to numerical examples and shows promising capability for identifying a temporal and spatial travel demand pattern.     

Estimating link travel time functions for heterogeneous traffic flows on freeways

Oversized vehicles, such as trucks, significantly contribute to traffic delays on freeways. Heterogeneous traffic populations, that is, those consisting of multiple vehicles types, can exhibit more complicated travel behaviors in the operating speed and performance, depending on the traffic volume as well as the proportions of vehicle types. In order to estimate the component travel time functions for heterogeneous traffic flows on a freeway, this study develops a microscopic traffic‐simulation based four‐step method. A piecewise continuous function is proposed for each vehicle type and its parameters are estimated using the traffic data generated by a microscopic traffic simulation model. The illustrated experiments based on VISSIM model indicate that (i) in addition to traffic volume, traffic composition has significant influence on the travel time of vehicles and (ii) the respective estimations for travel time of heterogeneous flows could greatly improve their estimation accuracy. Copyright © 2016 John Wiley & Sons, Ltd.     

Modeling and controlling an isolated urban intersection based on cooperative vehicles

In this paper, we propose a new approach for controlling the traffic at isolated intersections. We assume that all vehicles are equipped with on-board units (ITS station) that make them able to wirelessly negotiate the “right of way” according to the measurements done by the positioning system during their travel. A vehicle is allowed to cross the intersection if the green color is displayed to the driver in an on-board screen. The control aims to smooth the traffic through the sequence of vehicles authorized to traverse the intersection. The main challenge raised with the assumption is that the sequence must be dynamically formed by a real time application. The dynamic behavior of the traffic is considered discrete, in order to determine the switching rule according to the instantly observed events. We propose a model based on Timed Petri Nets with Multipliers (TPNM) which allows us to propose the control policy through the structural analysis. The resulting switching rules are very simplistic and efficient for isolated intersections. Indeed, microscopic simulations show that they perform as well as the optimal sequence based on the detection of vehicles at the entrance of the intersection. Moreover, the proposed approach has been tested through a real intersection.     

Identification of oversaturated intersections using high-resolution traffic signal data

Conceptually, an oversaturated traffic intersection is defined as one where traffic demand exceeds the capacity. Such a definition, however, cannot be applied directly to identify oversaturated intersections because measuring traffic demand under congested conditions is not an easy task, particularly with fixed-location sensors. In this paper, we circumvent this issue by quantifying the detrimental effects of oversaturation on signal operations, both temporally and spatially. The detrimental effect is characterized temporally by a residual queue at the end of a cycle, which will require a portion of green time in the next cycle; or spatially by a spill-over from downstream traffic whereby usable green time is reduced because of the downstream blockage. The oversaturation severity index (OSI), in either the temporal dimension (T-OSI) or the spatial dimension (S-OSI) can then be measured using high-resolution traffic signal data by calculating the ratio between the unusable green time due to detrimental effects and the total available green time in a cycle. To quantify the T-OSI, in this paper, we adopt a shockwave-based queue estimation algorithm to estimate the residual queue length. S-OSI can be identified by a phenomenon denoted as “Queue-Over-Detector (QOD)”, which is the condition when high occupancy on a detector is caused by downstream congestion. We believe that the persistence duration and the spatial extent with OSI greater than zero provide an important indicator for measuring traffic network performance so that corresponding congestion mitigation strategies can be prepared. The proposed algorithms for identifying oversaturated intersections and quantifying the oversaturation severity index have been field-tested using traffic signal data from a major arterial in the Twin Cities of Minnesota.