Real-time traffic network state estimation and prediction with decision support capabilities: Application to integrated corridor management

This paper presents a real-time traffic network state estimation and prediction system with built-in decision support capabilities for traffic network management. The system provides traffic network managers with the capabilities to estimate the current network conditions, predict congestion dynamics, and generate efficient traffic management schemes for recurrent and non-recurrent congestion situations. The system adopts a closed-loop rolling horizon framework in which network state estimation and prediction modules are integrated with a traffic network manager module to generate efficient proactive traffic management schemes. The traffic network manger adopts a meta-heuristic search mechanism to construct the schemes by integrating a wide variety of control strategies. The system is applied in the context of Integrated Corridor Management (ICM), which is envisioned to provide a system approach for managing congested urban corridors. A simulation-based case study is presented for the US-75 corridor in Dallas, Texas. The results show the ability of the system to improve the overall network performance during hypothetical incident scenarios.     

Network operation reliability in a Manhattan-like urban system with adaptive traffic lights

Traffic breakdown to global gridlock occurring in congested traffic network makes the serious traffic congestion even much worse. This paper has proposed to use Network Operation Reliability (NOR) to quantitatively depict the probabilistic feature of traffic breakdown to global gridlock. The Nagel–Schreckenberg cellular automaton model has been used to simulate the traffic flow in a Manhattan-like urban network. A simple adaptive traffic light strategy has been proposed. It has been shown that if vehicles choose to use geometric shortest path, the adaptive traffic signals are able to remarkably enhance the NOR and sometimes the average velocity and the arrival rate as well. The vehicle distribution has been investigated, which has heuristically explained the enhancement of the NOR. A simple perimeter control strategy has been shown to fail to enhance the NOR. Finally, we show that if the time shortest path information could be provided and updated timely, then the NOR can be remarkably enhanced but the adaptive traffic signals have only trivial effect on NOR.     

Accounting for traffic speed dynamics when calculating COPERT and PHEM pollutant emissions at the urban scale

Coupling a traffic microsimulation with an emission model is a means of assessing fuel consumptions and pollutant emissions at the urban scale. Dealing with congested states requires the efficient capture of traffic dynamics and their conditioning for the emission model. Two emission models are investigated here: COPERT IV and PHEM v11. Emission calculations were performed at road segments over 6 min periods for an area of Paris covering 3 km². The resulting network fuel consumption (FC) and nitrogen oxide (NOx) emissions are then compared. This article investigates: (i) the sensitivity of COPERT to the mean speed definition, and (ii) how COPERT emission functions can be adapted to cope with vehicle dynamics related to congestion. In addition, emissions are evaluated using detailed traffic output (vehicle trajectories) paired with the instantaneous emission model, PHEM.COPERT emissions are very sensitive to mean speed definition. Using a degraded speed definition leads to an underestimation ranging from −13% to −25% for fuel consumption during congested periods (from −17% to −36% respectively for NOx emissions). Including speed distribution with COPERT leads to higher emissions, especially under congested conditions (+13% for FC and +16% for NOx). Finally, both these implementations are compared to the instantaneous modeling chain results. Performance indicators are introduced to quantify the sensitivity of the coupling to traffic dynamics. Using speed distributions, performance indicators are more or less doubled compared to traditional implementation, but remain lower than when relying on trajectories paired with the PHEM emission model.     

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.     

Phase transition model of non-stationary traffic flow: Definition,properties and solution method

We consider the problem of modeling traffic phenomena at a macroscopic level. Increasing availability of streaming probe data allowing the observation of non-stationary traffic motivates the development of models capable of leveraging this information. We propose a phase transition model of non-stationary traffic in conservation form, capable of propagating joint measurements from fixed and mobile sensors, to model complex traffic phenomena such as hysteresis and phantom jams, and to account for forward propagation of information in congested traffic. The model is shown to reduce to the Lighthill–Whitham–Richards model within each traffic phase for the case of stationary states, and to have a physical mesoscopic interpretation in terms of drivers’ behavior. A corresponding discrete formulation appropriate for practical implementation is shown to provide accurate numerical solution to the proposed model. The performance of the model introduced is assessed on benchmark cases and on experimental vehicle trajectories from the NGSIM datasets.     

Behavior-consistent information-based network traffic control for evacuation operations

The evacuation operations problem aims to avoid or mitigate the potential loss of life in a region threatened or affected by a disaster. It is shaped to a large extent by the evolution of evacuation traffic resulting from the demand–supply interactions of the associated transportation network. Information-based control is a strategic tool for evacuation traffic operations as it can enable greater access to the affected population and more effective response. However, comparatively few studies have focused on the implementation of information-based control in evacuation operations. This study develops a control module for evacuation operations centered on addressing the demand–supply interactions by using behavior-consistent information strategies. These strategies incorporate the likely responses of evacuees to the information provided in the determination of route guidance information. The control module works as an iterative computational process involving an evacuee route choice model and a control model of information strategies to determine the route guidance information to direct evacuation traffic so as to approach a desired network traffic flow pattern. The problem is formulated as a fuzzy logic based optimization framework to explicitly incorporate practical concerns related to information dissemination characteristics and social equity in evacuation operations. Numerical experiments highlight the importance of accounting for the demand–supply interactions, as the use of behavior-consistent information strategies can lead evacuee route choices to approach the operator-desired proportions corresponding to the desired traffic pattern. The results also indicate that while a behavior-consistent information strategy can be effective, gaps with the desired route proportions can exist due to the discrete nature of the linguistic messages and the real-world difficulty in accurately modeling evacuees’ actual route choice behavior.     

Enhanced traffic information dissemination to facilitate toll road utilization: a nested logit model of a stated preference survey in Texas

This paper investigates the effects of the provision of traffic information on toll road usage based on a stated preference survey conducted in central Texas. Although many researchers have studied congestion pricing and traffic information dissemination extensively, most of them focused on the effects that these instruments individually produce on transportation system performance. Few studies have been conducted to elaborate on the impacts of traffic information dissemination on toll road utilization. In this study, 716 individuals completed a survey to measure representative public opinions and preferences for toll road usage in support of various traffic information dissemination classified by different modes, contents, and timeliness categories. A nested logit model was developed and estimated to identify the significant attributes of traffic information dissemination, traveler commuting patterns, routing behavior, and demographic characteristics, and analyze their impacts on toll road utilization. The results revealed that the travelers using dynamic message sign systems as their primary mode of receiving traffic information are more likely to choose toll roads. The potential toll road users also indicated their desire to obtain traffic information via internet. Information regarding accident locations, road hazard warnings, and congested roads is frequently sought by travelers. Furthermore, high-quality congested road information dissemination can significantly enhance travelers’ preferences of toll road usage. Specifically the study found that travelers anticipated an average travel time saving of about 11.3 min from better information; this is about 30 % of travelers’ average one-way commuting time. The mean value of the time savings was found to be about $11.82 per hour, close to ½ of the average Austin wage rate. The model specifications and result analyses provide in-depth insights in interpreting travelers’ behavioral tendencies of toll road utilization in support of traffic information. The results are also helpful to shape and develop future transportation toll system and transportation policy.     

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.     

A framework for user- and system-oriented optimisation of fuel efficiency and traffic flow in Adaptive Cruise Control

Fully automated vehicles could have a significant share of the road network traffic in the near future. Several commercial vehicles with full-range Adaptive Cruise Control (ACC) systems or semi-autonomous functionalities are already available on the market. Many research studies aim at leveraging the potential of automated driving in order to improve the fuel efficiency of vehicles. However, in the vast majority of those, fuel efficiency is isolated to the driving dynamics between a single follower-leader pair, hence overlooking the complex nature of traffic. Consequently fuel efficiency and the efficient use of the roadway capacity are framed as conflicting objectives, leading to fuel-economy control models that adopt highly conservative driving styles.This formulation of the problem could be seen as a user-optimal approach, where in spite of delivering savings for individual vehicles, there is the side-effect of the deterioration of traffic flow. An important point that is overlooked is that the inefficient use of roadway capacity gives rise to congested traffic and traffic breakdowns, which in return increases energy costs within the system. The optimisation methods used in these studies entail high computational costs and, therefore, impose a strict constraint on the scope of problem.In this study, the use of car-following models and the limitation of the search space of optimal strategies to the parameter space of these is proposed. The proposed framework enables performing much more comprehensive optimisations and conducting more extensive tests on the collective impacts of fuel-economy driving strategies. The results show that, as conjectured, a “short-sighted” user-optimal approach is unable to deliver overall fuel efficiency. Conversely, a system-optimal formulation for fuel efficient driving is presented, and it is shown that the objectives of fuel efficiency and traffic flow are in fact not only non-conflicting, but also that they could be viewed as one when the global benefits to the network are considered.     

Effect of traffic information on commuters' propensity to change route and departure time

Considerable public and private resources are devoted to the collection and dissemination of real-time traffic information in the Chicago area. Such information is intended to help individuals make more informed travel decisions, yet its effect on behavior remains largely unexplored. This study evaluates the effect of traffic information on travelers' route and departure time changes and provides a stronger basis for developing advanced information systems. Downtown Chicago automobile commuters were surveyed during the AM peak period. The results indicate that a majority of the respondents access, use and respond to information. For example, individuals use travel information to reduce their anxiety—even if they do not change travel decisions; this indicates that information may have “intrinsic” value. That is, simply knowing traffic conditions is valued by travelers. More than 60% of the respondents had used traffic information to modify their travel decisions. Multivariate analysis using the ordered probit model showed that individuals were more likely to use traffic reports for their route changes if they perceived traffic reports to be accurate and timely, and frequently listened to traffic reports. Respondents were more likely to change their departure times if they perceived traffic reports to be accurate and relevant, and frequently listened to traffic reports. The implication for Advanced Traveler Information Systems are that they may be designed to support both enroute and pre-trip decisions. ATIS performance, measured in terms of accuracy, relevance and timeliness would be critical in the success of such systems. Further, near-term prediction of traffic conditions on congested and unreliable routes (where conditions change rapidly) and incident durations is desirable.     

Analytical model for information flow propagation wave under an information relay control strategy in a congested vehicle-to-vehicle communication environment

Vehicular traffic congestion in a vehicle-to-vehicle (V2V) communication environment can lead to congestion effects for information flow propagation. Such congestion effects can impact whether a specific information packet of interest can reach a desired location, and if so, in a timely manner to influence the traffic system performance. Motivated by the usefulness and timeliness of information propagation, this paper aims to characterize the information flow propagation wave (IFPW) for an information packet in a congested V2V communication environment under an information relay control strategy. This strategy seeks to exclude information that is dated in the communication buffer under a first-in, first-out queue discipline, from being relayed if the information flow regime is congested. It trades off the need to enable the dissemination of every information packet as far as possible, against the congestion effects that accrue because of the presence of multiple information packets. A macroscopic two-layer model is proposed to characterize the IFPW. The upper layer is formulated as integro-differential equations to characterize the information dissemination in space and time under this control strategy. The lower layer adopts the Lighthill-Whitham-Richards model to capture the traffic flow dynamics. Based on the upper layer model, a necessary condition is derived which quantifies the expected time length that needs to be reserved for broadcasting the information packet of interest so as to ensure the formation of an IFPW under a given density of V2V-equipped vehicles. When the necessary condition is satisfied under homogeneous conditions, it is shown that the information packet can be propagated at an asymptotic speed whose value can be derived analytically. Besides, under the proposed control strategy, only a proportion of vehicles (labeled asymptotic density of informed vehicles) can receive the specific information packet, which can be estimated by solving a nonlinear equation. The asymptotic IFPW speed, the asymptotic density of informed vehicles, and the necessary condition for the IFPW, help in evaluating the timeliness of information propagation and the influence of traffic dynamics on information propagation. In addition, the proposed model can be used to numerically estimate the IFPW speed for heterogeneous conditions, which can aid in the design of traffic management strategies built upon the timely propagation of information through V2V communication.     

The existence, uniqueness and computation of an arc-based dynamic network user equilibrium formulation

In this paper, a dynamic user equilibrium traffic assignment model with simultaneous departure time/route choices and elastic demands is formulated as an arc-based nonlinear complementarity problem on congested traffic networks. The four objectives of this paper are (1) to develop an arc-based formulation which obviates the use of path-specific variables, (2) to establish existence of a dynamic user equilibrium solution to the model using Brouwer's fixed-point theorem, (3) to show that the vectors of total arc inflows and associated minimum unit travel costs are unique by imposing strict monotonicity conditions on the arc travel cost and demand functions along with a smoothness condition on the equilibria, and (4) to develop a heuristic algorithm that requires neither a path enumeration nor a storage of path-specific flow and cost information. Computational results are presented for a simple test network with 4 arcs, 3 nodes, and 2 origin–destination pairs over the time interval of 120 periods.     

Simultaneous estimation of an origin–destination matrix and link choice proportions using traffic counts

A procedure for the simultaneous estimation of an origin–destination (OD) matrix and link choice proportions from OD survey data and traffic counts for congested network is proposed in this paper. Recognizing that link choice proportions in a network change with traffic conditions, and that the dispersion parameter of the route choice model should be updated for a current data set, this procedure performs statistical estimation and traffic assignment alternately until convergence in order to obtain the best estimators for both the OD matrix and link choice proportions, which are consistent with the survey data and traffic counts.Results from a numerical study using a hypothetical network have shown that a model allowing θ to be estimated simultaneously with an OD matrix from the observed data performs better than the model with a fixed predetermined θ. The application of the proposed model to the Tuen Mun Corridor network in Hong Kong is also presented in this paper. A reasonable estimate of the dispersion parameter θ for this network is obtained.     

A traffic-condition-based route guidance strategy for a single destination road network

Most of existing route guidance strategies achieves user optimal equilibrium by comparing travel time. Measuring travel time, however, might be uneasy on an urban road network. To contend with the issue, the paper mainly considers easily obtained inflow and outflow of a link and road capacity as input, and proposes a route guidance strategy for a single destination road network based on the determination of free-flow or congested conditions on alternative routes. An extended strategy for a complex network and a feedback approximation for avoiding forecast are further explored. Weaknesses of the strategy are also explicitly analyzed. To test the strategy, simulation investigations are conducted on two networks with multiple parallel routes. The results indicate that the strategy is able to provide stable splitting rates and to approximate user optimal equilibrium in different conditions, in particular when traffic demand is high. This strategy has potential to be applied in an urban road network due to its simplicity and easily obtained input data. The strategy is also applicable for single destination if some alternatives and similar routes are available.     

Optimal distance- and time-dependent area-based pricing with the Network Fundamental Diagram

Given the efficiency and equity concerns of a cordon toll, this paper proposes a few alternative distance-dependent area-based pricing models for a large-scale dynamic traffic network. We use the Network Fundamental Diagram (NFD) to monitor the network traffic state over time and consider different trip lengths in the toll calculation. The first model is a distance toll that is linearly related to the distance traveled within the cordon. The second model is an improved joint distance and time toll (JDTT) whereby users are charged jointly in proportion to the distance traveled and time spent within the cordon. The third model is a further improved joint distance and delay toll (JDDT) which replaces the time toll in the JDTT with a delay toll component. To solve the optimal toll level problem, we develop a simulation-based optimization (SBO) framework. Specifically, we propose a simultaneous approach and a sequential approach, respectively, based on the proportional-integral (PI) feedback controller to iteratively adjust the JDTT and JDDT, and use a calibrated large-scale simulation-based dynamic traffic assignment (DTA) model of Melbourne, Australia to evaluate the network performance under different pricing scenarios. While the framework is developed for static pricing, we show that it can be easily extended to solve time-dependent pricing by using multiple PI controllers. Results show that although the distance toll keeps the network from entering the congested regime of the NFD, it naturally drives users into the shortest paths within the cordon resulting in an uneven distribution of congestion. This is reflected by a large clockwise hysteresis loop in the NFD. In contrast, both the JDTT and JDDT reduce the size of the hysteresis loop while achieving the same control objective. We further conduct multiple simulation runs with different random seed numbers to demonstrate the effectiveness of different pricing models against simulation stochasticity. However, we postulate that the feedback control is not applicable with guaranteed convergence if the periphery of the cordon area becomes highly congested or gridlocked.     

Network effects of intelligent speed adaptation systems

Intelligent Speed Adaptation (ISA) systems use in-vehicle electronic devices to enable the speed of vehicles to be regulated automatically. They are increasingly appreciated as a flexible method for speed management and control particularly in urban areas. On-road trials using a small numbers of ISA equipped vehicles have been carried out in Sweden, the Netherlands, Spain and the UK. This paper describes the developments made to enhance a traffic microsimulation model in order to represent ISA implemented across a network and the impact of this on the networks. The simulation modelling of the control system is carried out on a real-world urban network, and the impacts on traffic congestion, speed distribution and the environment assessed. The results show that ISA systems are more effective in less congested traffic conditions. Momentary high speeds in traffic are effectively suppressed, resulting in a reduction in speed variation which is likely to have a beneficial impact on safety. Whilst ISA reduces excessive traffic speeds in the network, it does not affect average journey times. In particular, the total vehicle-hours travelling at speeds below 10 km/hr have not changed, indicating that the speed control had not induced more slow-moving queues to the network. A statistically significant, eight percent, reduction in fuel consumption was found with full ISA penetration. These results are in accordance with those from field trials and they provide the basis for cost-benefit analyses on introducing ISA into the vehicle fleet. However, contrary to earlier findings from the Swedish ISA road trials, this study suggested that ISA is likely to have no significant effect on emission of gaseous pollutants CO, NO_x and HC.     

Identifying the onset of congestion rapidly with existing traffic detectors

From an operations standpoint the most important function of a traffic surveillance system is determining reliably whether the facility is free flowing or congested. The second most important function is responding rapidly when the facility becomes congested. These functions are complicated by the fact that conventional vehicle detectors are only capable of monitoring discrete points along the roadway while incidents may occur at any location on the facility. The point detectors are typically placed at least one-third of a mile apart and conditions between the detectors must be inferred from the local measurements.This paper presents a new approach for traffic surveillance that addresses these issues. It uses existing dual loop detector stations to match vehicle measurements between stations and monitor the entire roadway. Rather than expending a considerable effort to detect congested conditions, the research employs a relatively simple strategy to look for free flow traffic. Whenever a unique vehicle passes the downstream station, the algorithm looks to see if a similar vehicle passed the upstream station within a time window that is bounded by feasible travel times. The approach provides vehicle reidentification and travel time measurement on freeways during free flow and through the onset of congestion. If desired, other algorithms can be used with the same detectors to provide similar measurements during congested conditions. The work should prove beneficial for traffic management and traveler information applications, while promising to be deployable in the short term.     

Observing freeway ramp merging phenomena in congested traffic

This work conducts a comprehensive investigation of traffic behavior and characteristics during freeway ramp merging under congested traffic conditions. On the Tokyo Metropolitan Expressway, traffic congestion frequently occurs at merging bottleneck sections, especially during heavy traffic demand. The Tokyo Metropolitan Expressway public corporation, generally applies different empirical strategies to increase the flow rate and decrease the accident rate at the merging sections. However, these strategies do not rely either on any behavioral characteristics of the merging traffic or on the geometric design of the merging segments. There have been only a few research publications concerned with traffic behavior and characteristics in these situations. Therefore, a three‐year study is undertaken to investigate traffic behavior and characteristics during the merging process under congested situations. Extensive traffic data capturing a wide range of traffic and geometric information were collected using detectors, videotaping, and surveys at eight interchanges in Tokyo Metropolitan Expressway. Maximum discharged flow rate from the head of the queue at merging sections in conjunction with traffic and geometric characteristics were analyzed. In addition, lane changing maneuver with respect to the freeway and ramp traffic behaviors were examined. It is believed that this study provides a thorough understanding of the freeway ramp merging dynamics. In addition, it forms a comprehensive database for the development and implementation of congestion management techniques at merging sections utilizing Intelligent Transportation System.     

Dynamic Stackelberg equilibrium congestion pricing

This paper considers the problem of dynamic congestion pricing that determines optimal time-varying tolls for a pre-specified subset of arcs with bottleneck on a congested general traffic network. A two-person nonzero-sum dynamic Stackelberg game model is formulated with the assumption that the underlying information structure is open loop. Characteristics of the Stackelberg equilibrium solution are analyzed. The Hooke–Jeeves algorithm that obviates an evaluation of the gradient vector of the objective function is presented with a numerical example. The paper concludes with its future extensions.     

Network-oriented household activity pattern problem for system optimization

The recently emerging trend of self-driving vehicles and information sharing technologies, made available by private technology vendors, starts creating a revolutionary paradigm shift in the coming years for traveler mobility applications. By considering a deterministic traveler decision making framework at the household level in congested transportation networks, this paper aims to address the challenges of how to optimally schedule individuals’ daily travel patterns under the complex activity constraints and interactions. We reformulate two special cases of household activity pattern problem (HAPP) through a high-dimensional network construct, and offer a systematic comparison with the classical mathematical programming models proposed by Recker (1995). Furthermore, we consider the tight road capacity constraint as another special case of HAPP to model complex interactions between multiple household activity scheduling decisions, and this attempt offers another household-based framework for linking activity-based model (ABM) and dynamic traffic assignment (DTA) tools. Through embedding temporal and spatial relations among household members, vehicles and mandatory/optional activities in an integrated space-time-state network, we develop two 0–1 integer linear programming models that can seamlessly incorporate constraints for a number of key decisions related to vehicle selection, activity performing and ridesharing patterns under congested networks. The well-structured network models can be directly solved by standard optimization solvers, and further converted to a set of time-dependent state-dependent least cost path-finding problems through Lagrangian relaxation, which permit the use of computationally efficient algorithms on large-scale high-fidelity transportation networks.