Cooperative traffic control of a mixed network with two urban regions and a freeway

Currently most optimization methods for urban transport networks (i) are suited for networks with simplified dynamics that are far from real-sized networks or (ii) apply decentralized control, which is not appropriate for heterogeneously loaded networks or (iii) investigate good-quality solutions through micro-simulation models and scenario analysis, which make the problem intractable in real time. In principle, traffic management decisions for different sub-systems of a transport network (urban, freeway) are controlled by operational rules that are network specific and independent from one traffic authority to another. In this paper, the macroscopic traffic modeling and control of a large-scale mixed transportation network consisting of a freeway and an urban network is tackled. The urban network is partitioned into two regions, each one with a well-defined Macroscopic Fundamental Diagram (MFD), i.e. a unimodal and low-scatter relationship between region density and outflow. The freeway is regarded as one alternative commuting route which has one on-ramp and one off-ramp within each urban region. The urban and freeway flow dynamics are formulated with the tool of MFD and asymmetric cell transmission model, respectively. Perimeter controllers on the border of the urban regions operating to manipulate the perimeter interflow between the two regions, and controllers at the on-ramps for ramp metering are considered to control the flow distribution in the mixed network. The optimal traffic control problem is solved by a Model Predictive Control (MPC) approach in order to minimize total delay in the entire network. Several control policies with different levels of urban-freeway control coordination are introduced and tested to scrutinize the characteristics of the proposed controllers. Numerical results demonstrate how different levels of coordination improve the performance once compared with independent control for freeway and urban network. The approach presented in this paper can be extended to implement efficient real-world control strategies for large-scale mixed traffic networks.     

A probabilistic optimization model for allocating freeway sensors

This paper proposes a sensor location model to identify a sensor configuration that minimizes overall freeway performance monitoring errors while considering the consequences of probabilistic sensor failures. To date, existing sensor location models for freeway monitoring inherently assume that either deployed sensors never fail or the consequences of sensor failure are trivial matters. However, history has revealed that neither assumption is realistic, suggesting that ignoring failures in sensor allocation models may actually produce a significantly suboptimal configuration in the real world. Our work addresses this dilemma by developing a probabilistic optimization model that will minimize the error expectation by examining all possible failure scenarios, each with an occurrence probability. To ensure the scenario completeness and uniqueness, a sensor failure scenario is represented by using a binary string with 1 indicating an operational sensor at a given site and 0 for sensor failure or no sensor deployed. When applied to a case study network, it is shown that an optimal configuration that considers sensor failure is significantly different from an optimal configuration that ignores sensor failure, revealing that sensor failures pose non-trivial consequences on performance monitoring accuracy.     

Heterogeneous sensor location model for path reconstruction

A new traffic sensor location problem is developed and solved by strategically placing both passive and active sensors in a transportation network for path reconstruction. Passive sensors simply count vehicles, while active sensors can recognize vehicle plates but are more expensive. We developed a two-stage heterogeneous sensor location model to determine the most cost-effective strategies for sensor deployment. The first stage of the model adopts the path reconstruction model defined by Castillo et al. (2008b) to determine the optimal locations of active sensors in the network. In the second stage, an algebraic framework is developed to strategically replace active sensors so that the total installation cost can be reduced while maintaining path flow observation quality. Within the algebraic framework, a scalar product operator is introduced to calculate path flows. An extension matrix is generated and used to determine if a replacement scheme is able to reconstruct all path flows. A graph model is then constructed to determine feasible replacement schemes. The problem of finding the optimal replacement scheme is addressed by utilizing the theory of maximum clique to obtain the upper bound of the number of replaced sensors and then revising this upper bound to generate the optimal replacement scheme. A polynomial-time algorithm is proposed to solve the maximum clique problem, and the optimal replacement scheme can be obtained accordingly. Three numerical experiments show that our proposed two-stage method can reduce the total costs of transportation surveillance systems without affecting the system monitor quality. The locations of the active sensors play a more critical role than the locations of the passive sensors in the number of reconstructed paths.     

Review of optimal sensor location models for travel time estimation

The problem of optimally locating fixed sensors on a traffic network infrastructure has been object of growing interest in the past few years. Sensor location decisions models differ from each other according to the type of sensors that are to be located and the objective that one would like to optimize. This paper surveys the existing contributions in the literature related to the problem of locating fixed sensors on the network to estimate travel times. The review consists of two parts: the first part reviews the methodological approaches for the optimal location of counting sensors on a freeway for travel time estimation; the second part focuses on the results related to the optimal location of Automatic Vehicle Identification (AVI) readers on the links of a network to get travel time information.     

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.     

A new approach to time-of-day control based on a dynamic freeway traffic model

This paper presents a new approach to time-of-day control. While time-of-day control strategies presented up-to-now are only optimal under steady-state conditions, the control algorithm derived in this paper takes into account the evolution of traffic flow according to the time delay between a volume change at a ramp and its subsequent disturbance at a freeway point downstream. The new control strategy is based on the solution of a linear programming optimization problem and makes freeway volume hold the capacity constraints for the total time of control operation. In order to reduce the computational effort a simplified version of the new algorithm is also discussed. Simulation results obtained by use of two different traffic flow models show that control derived through the new algorithm can avoid congestion and ensure operation with peak performance even if a steady-state condition is never attained.     

Machine learning for multi-jurisdictional optimal traffic corridor control

Urban traffic corridors are often controlled by more than one agency. Typically in North America, a state of provincial transportation department controls freeways while another agency at the municipal or city level controls the nearby arterials. While the different segments of the corridor fall under different jurisdictions, traffic and users know no boundaries and expect seamless service. Common lack of coordination amongst those authorities due to lack of means for information exchange and/or possible bureaucratic ‘institutional grid-lock’ could hinder the full potential of technically-possible integrated control. Such institutional gridlock and related lack of timely coordination amongst the different agencies involved can have a direct impact on traffic gridlock. One potential solution to this problem is through integrated automatic control under intelligent transportation systems (ITS). Advancements in ITS and communication technology have the potential to considerably reduce delay and congestion through an array of network-wide traffic control and management strategies that can seamlessly cross-jurisdictional boundaries. Perhaps two of the most promising such control tools for freeway corridors are traffic-responsive ramp metering and/or dynamic traffic diversion possibly using variable message signs (VMS). Technically, the use of these control methods separately might limit their potential usefulness. Therefore, integrated corridor control using ramp metering and VMS diversion simultaneously might be synergetic and beneficial. Motivated by the above problem and potential solution approach, the aim of the research presented in this paper is to develop a self-learning adaptive integrated freeway-arterial corridor control for both recurring and non-recurring congestion. The paper introduces the use of reinforcement learning, an Artificial Intelligence method for machine learning, to provide optimal control using ramp metering and VMS routing in an integrated agent for a freeway-arterial corridor. Reinforcement learning is an approach whereby the control agent directly learns optimal strategies via feedback reward signals from its environment. A simple but powerful reinforcement learning method known as Q-learning is used. Results from an elaborate simulation study on a key corridor in Toronto are very encouraging and discussed in the paper.     

A generalized sensor location model for the estimation of network origin–destination matrices

This study examined the network sensor location problem by using heterogeneous sensor information to estimate link-based network origin–destination (O–D) demands. The proposed generalized sensor location model enables different sensors’ traffic monitoring capabilities to be used efficiently and the optimal number and deployment locations of both passive- and active-type sensors to be determined simultaneously without path enumeration. The proposed sensor location model was applied to solve the network O–D demand estimation problem. One unique aspect of the proposed model and solution algorithms is that they provide satisfactory network O–D demand estimates without requiring unreasonable assumptions of known prior information on O–D demands, turning proportions, or route choice probabilities. Therefore, the proposed model and solution algorithms can be practically used in numerous offline transportation planning and online traffic operation applications.     

A hierarchical control system for freeway traffic

A hierarchical control system consisting of three control layers is developed for the freeway traffic control problem. A simplified optimization problem for the overall freeway system is solved on-line in an optimization layer. Optimization results are used as reference values for an inferior decentralized direct control layer. Prediction of slowly varying variables like on-ramp demands and origin-destination rates as well as of particular model parameters are provided by a supremal adaption layer. The overall control structure is shown to be robust even in the case of strong unexpected disturbances like incidents.     

Discrete dynamic models for freeway incident detection systems

This paper considers the problem of freeway incident detection within the general framework of computer‐based freeway surveillance and control. A new approach to the detection of freeway traffic incidents is presented based on a discrete‐time stochastic model of the form ARIMA (0, 1, 3) that describes the dynamics of traffic occupancy observations. This approach utilizes real‐time estimates of the variability in traffic occupancies as detection thresholds, thus eliminating the need for threshold calibration and lessening the problem of false‐alarms. Because the moving average parameters of the ARIMA (0, 1, 3) model change over time, these parameters can be updated occasionally. The performance of the developed detection algorithm has been evaluated in terms of detection rate, false‐alarm rate, and average time‐lag to detection, using a total of 1692 minutes of occupancy observations recorded during 50 representative traffic incidents.     

A fuzzy-logic-based system for freeway bottleneck severity diagnosis in a sensor network

It is essential for local traffic jurisdictions to systematically spot freeway bottlenecks and proactively deploy appropriate congestion mitigation strategies. However, diagnostic results may be influenced by unreliable measurements, analysts’ subjective knowledge and day-to-day traffic pattern variations. In order to suitably address these uncertainties and imprecise data, this study proposes a fuzzy-logic-based approach for bottleneck severity diagnosis in urban sensor networks. A dynamic bottleneck identification model is first proposed to identify bottleneck locations, and a fuzzy inference approach is then proposed to systematically diagnose the severities of the identified recurring and non-recurring bottlenecks by incorporating expert knowledge of local traffic conditions. Sample data over a 1-month period on an urban freeway in Northern Virginia was used as a case study for the analysis. The results reveal that the proposed approach can reasonably determine bottleneck severities and critical links, accounting for both spatial and temporal factors in a sensor network.     

A graphical approach to identify sensor locations for link flow inference

Information of link flows in a traffic network becomes increasingly critical in contemporary transportation practice and researches. The network sensor installation is carried out to supply such information. In this paper, we present a graphical approach to determine the smallest subset of links in a traffic network for counting sensor installation, so as to infer the flows on all remaining links. The elegant assumption-free character of the problem introduced by Hu, Peeta and Chu is still kept in this approach. This study points out the topological tree feature of solutions that makes it possible for traffic management agencies to easily and flexibly select links for sensor installation in practice. Addressing from the same graphical perspective, we provide solutions to four other important problems about sensor locations. The preceding two problems are, in traffic networks that already have sensors installed on some links, to identify the subset of links on which link flows can be inferred from sensor measurements and to determine the smallest subset of links on which counting sensors also need to be installed so as to infer link flows on all remaining non-equipped links. The third is to identify the optimal locations for a given number of sensors so as to infer flows on as many links as possible by gradually enlarging the number of links included in circuits. The last one is to determine the smallest subset of links on which to install sensors, in such a way that it becomes possible at the same time to satisfy prior requirements and infer the flows on all remaining links, through building a minimum spanning tree. These methods can be applied to all kinds of long-term planning and link-based applications in traffic networks.     

A problem of limited-access special lanes. Part I: Spatiotemporal studies of real freeway traffic

Most special-use freeway lanes in the US, whether reserved for carpools, toll-paying commuters or both, are physically separated from the adjacent regular-use lanes by some form of barrier. Vehicle movements in and out of a special lane of this type are permitted only at select access points along the route. The barrier at each select point might open for a distance of 400 m or so. Limiting access in this way is said to reduce the “turbulence” that might otherwise occur were the special lane not to have a barrier, such that vehicles could instead enter or exit that lane anywhere along its length.Yet, real freeway traffic studied in spatiotemporal fashion shows that access points are prone to become bottlenecks. The problem occurs when traffic in the regular lanes becomes dense, as commonly happens during a rush. Drivers then seek refuge in the special lane in greater numbers. Since the vehicular maneuvers through the access point are focused within a limited physical space, they can become disruptive and further degrade traffic. Degradation can occur both in the special lane and in the adjacent regular ones. The damage can be worse than when there is no barrier to limit special-lane ingress and egress.The problem is shown to be reproducible across sites and across days at each site. Policy implications are discussed. Select designs and policies to address the problem are thereafter explored in Part II of the paper using traffic simulation.     

Convexity and robustness of dynamic traffic assignment and freeway network control

We study the use of the System Optimum (SO) Dynamic Traffic Assignment (DTA) problem to design optimal traffic flow controls for freeway networks as modeled by the Cell Transmission Model, using variable speed limit, ramp metering, and routing. We consider two optimal control problems: the DTA problem, where turning ratios are part of the control inputs, and the Freeway Network Control (FNC), where turning ratios are instead assigned exogenous parameters. It is known that relaxation of the supply and demand constraints in the cell-based formulations of the DTA problem results in a linear program. However, solutions to the relaxed problem can be infeasible with respect to traffic dynamics. Previous work has shown that such solutions can be made feasible by proper choice of ramp metering and variable speed limit control for specific traffic networks. We extend this procedure to arbitrary networks and provide insight into the structure and robustness of the proposed optimal controllers. For a network consisting only of ordinary, merge, and diverge junctions, where the cells have linear demand functions and affine supply functions with identical slopes, and the cost is the total traffic volume, we show, using the Pontryagin maximum principle, that variable speed limits are not needed in order to achieve optimality in the FNC problem, and ramp metering is sufficient. We also prove bounds on perturbation of the controlled system trajectory in terms of perturbations in initial traffic volume and exogenous inflows. These bounds, which leverage monotonicity properties of the controlled trajectory, are shown to be in close agreement with numerical simulation results.     

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.     

Network sensor health problem

Many existing studies on the sensor health problem determine an individual sensor’s health status based on the statistical characteristics of collected data by the sensor. In this research, we study the sensor health problem at the network level, which is referred to as the network sensor health problem. First, based on the conservation principle of daily flows in a network, we separate all links into base links and non-base links, such that the flows on the latter can be calculated from those on the former. In reality, the network flow conservation principle can be violated due to the existence of unhealthy sensors. Then we define the least inconsistent base set of links as those that minimize the sum of squares of the differences between observed and calculated flows on non-base links. But such least inconsistent base sets may not be unique in a general road network. Finally we define the health index of an individual sensor as the frequency that it appears in all of the least inconsistent base sets. Intuitively, a lower health index suggests that the corresponding sensor is more likely to be unhealthy. We present the brute force method to find all least inconsistent base sets and calculate the health indices. We also propose a greedy search algorithm to calculate the approximate health indices more efficiently. We solve the network sensor health problem for a real-world example with 16 nodes and 30 links, among which 18 links are monitored with loop detectors. Using daily traffic count data from the Caltrans Performance Measurement System (PeMS) database, we use both the brute-force and greedy search methods to calculate the health indices for all the sensors. We find that all the four sensors flagged as unhealthy (high value) by PeMS have the lowest health indices. This confirms that a sensor with a lower health index is more likely to be unhealthy. Therefore, we can use such health indices to determine the relative reliability of different sensors’ data and prioritize the maintenance of sensors.     

Vehicle identification sensor models for origin–destination estimation

The traditional approach to origin–destination (OD) estimation based on data surveys is highly expensive. Therefore, researchers have attempted to develop reasonable low-cost approaches to estimating the OD vector, such as OD estimation based on traffic sensor data. In this estimation approach, the location problem for the sensors is critical. One type of sensor that can be used for this purpose, on which this paper focuses, is vehicle identification sensors. The information collected by these sensors that can be employed for OD estimation is discussed in this paper. We use data gathered by vehicle identification sensors that include an ID for each vehicle and the time at which the sensor detected it. Based on these data, the subset of sensors that detected a given vehicle and the order in which they detected it are available. In this paper, four location models are proposed, all of which consider the order of the sensors. The first model always yields the minimum number of sensors to ensure the uniqueness of path flows. The second model yields the maximum number of uniquely observed paths given a budget constraint on the sensors. The third model always yields the minimum number of sensors to ensure the uniqueness of OD flows. Finally, the fourth model yields the maximum number of uniquely observed OD flows given a budget constraint on the sensors. For several numerical examples, these four models were solved using the GAMS software. These numerical examples include several medium-sized examples, including an example of a real-world large-scale transportation network in Mashhad.     

Co-design of traffic network topology and control measures

The two main directions to improve traffic flows in networks involve changing the network topology and introducing new traffic control measures. In this paper, we consider a co-design approach to apply these two methods jointly to improve the interaction between different methods and to get a better overall performance. We aim at finding the optimal network topology and the optimal parameters of traffic control laws at the same time by solving a co-optimization problem. However, such an optimization problem is usually highly non-linear and non-convex, and it possibly involves a mixed-integer form. Therefore, we discuss four different solution frameworks that can be used for solving the co-optimization problem, according to different requirements on the computational complexity and speed. A simulation-based study is implemented on the Singapore freeway network to illustrate the co-design approach and to compare the four different solution frameworks.     

Stochasticity of freeway operational capacity and chance-constrained ramp metering

The notion of capacity is essential to the planning, design, and operations of freeway systems. However, in the practice freeway capacity is commonly referred as a theoretical/design value without consideration of operational characteristics of freeways. This is evident from the Highway Capacity Manual (HCM) 2000 in that no influence from downstream traffic is considered in the definition of freeway capacity. In contrast to this definition, in this paper, we consider the impact of downstream traffic and define freeway operational capacity as the maximum hourly rate at which vehicles can be expected to traverse a point or a uniform section of a roadway under prevailing traffic flow conditions. Therefore freeway operational capacity is not a single value with theoretical notion. Rather, it changes under different traffic flow conditions. Specifically, this concept addresses the capacity loss during congested traffic conditions. We further study the stochasticity of freeway operational capacity by examining loop detector data at three specifically selected detector stations in the Twin Cities’ area. It is found that values of freeway operational capacity under different traffic flow conditions generally fit normal distributions. In recognition of the stochastic nature of freeway capacity, we propose a new chance-constrained ramp metering strategy, in which, constant capacity value is replaced by a probabilistic one that changes dynamically depending on real-time traffic conditions and acceptable probability of risk determined by traffic engineers. We then improve the Minnesota ZONE metering algorithm by applying the stochastic chance constraints and test the improved algorithm through microscopic traffic simulation. The evaluation results demonstrate varying degrees of system improvement depending on the acceptable level of risk defined.     

Two-class freeway traffic regulation to reduce congestion and emissions via nonlinear optimal control

The objective of this paper is the regulation of freeway traffic by means of optimal control techniques. A first innovative aspect of the proposed approach is the adopted objective function in which, besides the reduction of traffic congestion (which is typically considered in traffic control schemes), the minimization of traffic emissions is also included. Moreover, a multi-class framework is defined in which two classes of vehicles (cars and trucks) are explicitly modelled, and specific control actions for each vehicle class are sought. This results in the formulation of a multi-objective optimal control problem which is described in the paper and for which a specific solution algorithm is developed and used. The algorithm exploits a specific version of the feasible direction algorithm whose effectiveness is demonstrated in the paper by means of simulation results.