An improved cellular automata model for heterogeneous work zone traffic

This paper aims to develop an improved cellular automata (ICA) model for simulating heterogeneous traffic in work zone. The proposed ICA model includes the forwarding rules to update longitudinal speeds and positions of work zone vehicles. The randomization probability parameter used by the ICA is formulated as a function of the activity length, the transition length and the volumes of different types of vehicles traveling across work zone. Compared to the existing cellular automata models, the ICA model possesses a novel and realistic lateral speed and position updating rule so that the simulation of vehicle’s lateral movement in work zone is close to the reality. The ICA model is calibrated and validated microscopically and macroscopically by using the real work zone data. Comparisons of field data and ICA for trajectories, speed and speed–flow relationship in work zone show very close agreement. Finally, the proposed ICA model is applied to estimate traffic delay occurred in work zone.     

Modelling the effects of road pricing on traffic using ERP traffic data

Singapore’s Electronic Road Pricing (ERP) system involves time-variable charges which are intended to spread the morning traffic peak. The charges are revised every three months and thus induce regular motorists to re-think their travel decisions. ERP traffic data, captured by the system, provides a valuable source of information for studying motorists’ travel behaviour. This paper proposes a new modelling methodology for using these data to forecast short-term impacts of rate adjustment on peak period traffic volumes. Separate models are developed for different categories of vehicles which are segmented according to their demand elasticity with respect to road pricing. A method is proposed for estimating the maximum likelihood value of preferred arrival time (PAT) for each vehicle’s arrivals at a particular ERP gantry under different charging conditions. Iterative procedures are used in both model calibration and application. The proposed approach was tested using traffic datasets recorded in 2003 at a gantry located on Singapore’s Central Expressway (CTE). The model calibration and validation show satisfactory results.     

Adaptive traffic signal control using approximate dynamic programming

This paper presents a study on an adaptive traffic signal controller for real-time operation. The controller aims for three operational objectives: dynamic allocation of green time, automatic adjustment to control parameters, and fast revision of signal plans. The control algorithm is built on approximate dynamic programming (ADP). This approach substantially reduces computational burden by using an approximation to the value function of the dynamic programming and reinforcement learning to update the approximation. We investigate temporal-difference learning and perturbation learning as specific learning techniques for the ADP approach. We find in computer simulation that the ADP controllers achieve substantial reduction in vehicle delays in comparison with optimised fixed-time plans. Our results show that substantial benefits can be gained by increasing the frequency at which the signal plans are revised, which can be achieved conveniently using the ADP approach.     

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.     

A note on a graphical interpretation of wave and shockwave velocities of a traffic stream

This note gives simple equations for wave and shockwave velocities, using a graphical interpretation of speed-intercepts on the speed-concentration and speed-flow curves.     

Multi-modal traffic signal control with priority,signal actuation and coordination

Both coordinated-actuated signal control systems and signal priority control systems have been widely deployed for the last few decades. However, these two control systems are often conflicting with each due to different control objectives. This paper aims to address the conflicting issues between actuated-coordination and multi-modal priority control. Enabled by vehicle-to-infrastructure (v2i) communication in Connected Vehicle Systems, priority eligible vehicles, such as emergency vehicles, transit buses, commercial trucks, and pedestrians are able to send request for priority messages to a traffic signal controller when approaching a signalized intersection. It is likely that multiple vehicles and pedestrians will send requests such that there may be multiple active requests at the same time. A request-based mixed-integer linear program (MILP) is formulated that explicitly accommodate multiple priority requests from different modes of vehicles and pedestrians while simultaneously considering coordination and vehicle actuation. Signal coordination is achieved by integrating virtual coordination requests for priority in the formulation. A penalty is added to the objective function when the signal coordination is not fulfilled. This “soft” signal coordination allows the signal plan to adjust itself to serve multiple priority requests that may be from different modes. The priority-optimal signal timing is responsive to real-time actuations of non-priority demand by allowing phases to extend and gap out using traditional vehicle actuation logic. The proposed control method is compared with state-of-practice transit signal priority (TSP) both under the optimized signal timing plans using microscopic traffic simulation. The simulation experiments show that the proposed control model is able to reduce average bus delay, average pedestrian delay, and average passenger car delay, especially for highly congested condition with a high frequency of transit vehicle priority requests.     

Effect of signal coordination on traffic emission

This study investigates the effect of traffic signal coordination on emissions and compares it with their effects on operational performance measures of delay and stops. Various platoon ratios are obtained by simulating cycle lengths and offsets. Our results indicate that the impact of the cycle length on delay is more significant than those on stops and emissions for under-saturation traffic conditions. Given a fixed cycle length, increasing the platoon ratio can reduce delay, stops, and emissions, with reduction in emissions being correlated with stops than delay. The effect on emissions from the platoon arrival with respect to the onset of green or red indication is identified. With the same cycle length and platoon ratio, the early arrival situation, when the leading vehicles of a platoon encounters the red signal, can generate more emissions than are associated with late platoon arrival, when the last few vehicles in a platoon are stopped at the intersection by the onset of the red signal.     

A note on traffic assignment and signal timings in a signal-controlled road network

This paper discusses the problems of using signal timings in a signal-controlled road network to influence equilibrium flows in such a way that some network performance index, e.g. total travel time, is optimised, given that at equilibrium each driver is using a minimum-time route. By means of a simple example, we show that an intuitively acceptable approach explored in other articles does not work and may, in fact, lead to a decline in network performance rather than an improvement.     

Dynamic system-optimal traffic assignment using a state space model

We propose a new mathematical formulation for the problem of optimal traffic assignment in dynamic networks with multiple origins and destinations. This problem is motivated by route guidance issues that arise in an Intelligent Vehicle-Highway Systems (IVHS) environment. We assume that the network is subject to known time-varying demands for travel between its origins and destinations during a given time horizon. The objective is to assign the vehicles to links over time so as to minimize the total travel time experienced by all the vehicles using the network. We model the traffic network over the time horizon as a discrete-time dynamical system. The system state at each time instant is defined in a way that, without loss of optimality, avoids complete microscopic detail by grouping vehicles into platoons irrespective of origin node and time of entry to network. Moreover, the formulation contains no explicit path enumeration. The state transition function can model link travel times by either impedance functions, link outflow functions, or by a combination of both. Two versions (with different boundary conditions) of the problem of optimal traffic assignment are studied in the context of this model. These optimization problems are optimal control problems for nonlinear discrete-time dynamical systems, and thus they are amenable to algorithmic solutions based on dynamic programming. The computational challenges associated with the exact solution of these problems are discussed and some heuristics are proposed.     

Optimal offsets for traffic signal systems in urban networks

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

Selection of expert system shells for traffic signal design

Although the use of expert systems (ESs) as a problem-solving tool is relatively new in the transportation profession, it has been recognized that a well-designed ES can contribute in areas where the knowledge domain requires an integration of expertise from various disciplines or is very complex and difficult to quantify. To minimize the effort involved in developing essential ES mechanisms, researchers often prefer to use ES shells which provide a standard inference procedure, knowledge representation, and a user-friendly design environment. However, commercial ES shells tend to be designed for only certain classes of problems, and are not as general and flexible as programming languages. More than 150 commercial ES shells are available in the microcomputer market. Most ES shells are usually claimed by their vendors to be usable for almost any conceivable applications, but such claims have often proved to be extravagant. Hence, the selection of an efficient yet costeffective commercial shell is one of the most critical tasks in ES development. In reviewing the vital task of ES shell selection, this paper presents our experience in evaluating more than 30 ES shells for developing an ES for signal design. The proposed ES includes signal settings, phasing plans, controllers, and detector locations.     

An iterative group-based signal optimization scheme for traffic equilibrium networks

This paper presents an iterative scheme for a combined signal optimization and assignment problem, using a traffic model from the well-known procedure TRANSYT. The signal settings are optimized by means of a group-based technique, in which the signal timings are specified by the common cycle time, the start time and duration of the period of right of way for each signal group in the network. The optimization problem was formulated as an integer program and solved by a set of heuristics. Given the optimized signal settings determined from the group-based technique, a path-based assignment algorithm is employed to obtain the equilibrium traffic pattern using the sensitivity information for TRANSYT model and a Frank-Wolf method. Based on the equilibrium flow pattern, the group-based optimization algorithm is then used to determine a better set of signal timings. The procedure is repeated until certain convergence criteria are satisfied. A numerical example is employed to demonstrate the benefits obtained from this iterative scheme. Encouraging results are obtained.     

An application of shock wave theory to traffic signal control

A real time control policy minimizing total intersection delays subject to queue length constraints at an isolated signalized intersection is developed in this paper. The policy is derived from a new traffic model which describes the simultaneous evolution of queue lengths of two conflicting traffic streams, controlled by a traffic light, in both time and space. The model is based on the examination of shock waves generated upstream of the stop lines by the intermittent service of traffic at the signal. The proposed policy was tested against the existing pre-timed control policy at a high volume intersection and it was found superior, especially when demands increase well above the saturation level.     

Real-time traffic estimation using data expansion

This paper presents a method for estimating missing real-time traffic volumes on a road network using both historical and real-time traffic data. The method was developed to address urban transportation networks where a non-negligible subset of the network links do not have real-time link volumes, and where that data is needed to populate other real-time traffic analytics. Computation is split between an offline calibration and a real-time estimation phase. The offline phase determines link-to-link splitting probabilities for traffic flow propagation that are subsequently used in real-time estimation. The real-time procedure uses current traffic data and is efficient enough to scale to full city-wide deployments. Simulation results on a medium-sized test network demonstrate the accuracy of the method and its robustness to missing data and variability in the data that is available. For traffic demands with a coefficient of variation as high as 40%, and a real-time feed in which as much as 60% of links lack data, we find the percentage root mean square error of link volume estimates ranges from 3.9% to 18.6%. We observe that the use of real-time data can reduce this error by as much as 20%.     

Overtaking assistant assessment using traffic simulation

This contribution presents the results of a microscopic traffic simulation study of the potential effects of an overtaking assistant for two-lane rural roads. The overtaking assistant is developed to support drivers in judging whether or not an overtaking opportunity can be accepted based on the distance to the next oncoming vehicle. Drivers have been found to consider this to be a difficult part of an overtaking manoeuvre. The assistant’s effects on traffic efficiency, driver comfort and road safety have been investigated using traffic simulation. The results indicate that this type of overtaking assistant can provide safety benefits in terms of increased average time-to-collision to the next oncoming vehicle during overtaking manoeuvres. This safety benefit can be achieved without negative consequences for traffic efficiency and driver comfort. A driver assistance system that supports the distance judging part of overtaking manoeuvres can therefore contribute to improved traffic conditions on the two-lane rural roads of the future.     

Modelling traffic flows and estimating road travel times in transportation network under dynamic disturbances

Transportation - Traffic congestion is a common phenomenon in road transportation networks, especially during peak hours. More accurate prediction of dynamic traffic flows is very important for...     

Analytical model of traffic delays under bus signal preemption: Theory and application

Major emphasis has been placed in recent years on the improvement of the operations of existing transportation facilities, using Transportation Systems Management strategies. Accordingly, preferential treatment of high occupancy vehicles is playing an increasing role in transportation projects. This paper deals with one of these strategies, the priority treatment of buses at signalized intersections. Such treatment is aimed at improving the capacity of intersections. The paper develops an analytical model of delays at signalized intersections under a bus preemption scheme. The analysis is presented for the simplest case, i.e., two intersecting one-way streets. The results suggests that the benefits of bus preemption can be increased by properly adjusting several design parameters such as cycle and phase duration of the preempted phases as well as the non-preempted parameters. The model outlined in this paper is applicable to any situation in which stochastic variation is introduced into the signal cycle as well as to bus preemption. Consequently, other potential applications of the model include the design/analysis of traffic actuated signals, and pedestrian actuated signals.     

Tolling traffic links under stochastic assignment: Modelling the relationship between the number and price level of tolled links and optimal traffic flows

The classical road-tolling problem is to toll network links such that under the principles of Wardropian User Equilibrium Assignment a System Optimising (SO) flow pattern is obtained. Stochastic assignment methods are accepted to be more realistic than deterministic and it is of interest to examine the potential for optimal tolling in the case of Stochastic User Equilibrium (SUE). In examining the case of Stochastic User Equilibrium the ‘desired flow pattern’ to be created must first be determined. The classical economics solution of replacing unit-cost flow functions with marginal-cost flow functions which under deterministic assignment produces the System Optimal solution (where Total Network Travel Cost (TNTC) is minimised) does not generally result in TNTC being minimised in the Stochastic Case. Instead such tolls produce a ‘Stochastic System Optimal’ (SSO) solution where the Total Perceived Network Travel Cost (TPNTC) is minimised.This paper examines and compares link-based tolling solutions to achieve both the SSO (TPNTC minimised) and true SO (TNTC minimised) under SUE and illustrates the concept with numerical examples. Such link-based tolling schemes produce network benefit by re-routing rather than traffic suppression as opposed to the cordon-based charging schemes which have been implemented in practice. Equity issues relating to charging schemes are discussed and the desirability of zero-toll routes is highlighted associated with greater potential political acceptability of charging schemes that do not impose excessive charges upon users (such as minimal or low revenue tolls). A heuristic is developed to toll network links in such a way as to balance the number of links tolled against the revenue required to produce a desired reduction in TNTC such that optimal network flow patterns are approached.