Anticipating emission-sensitive traffic management strategies for dynamic delivery routing

Traffic pollution is an increasing challenge for cities. Emissions such as nitrogen dioxides pose a major health threat to the city’s inhabitants. These emissions often accumulate to critical levels in local areas of the city. To react to these critical emission levels, cities start implementing dynamic traffic management systems (TMS). These systems dynamically redirect traffic flows away from critical areas. These measures impact the travel speeds within the city. This is of particular importance for parcel delivery companies. These companies deliver goods to customers in the city. To avoid long delivery times and higher costs, companies already adapt their routing with respect to changing traffic conditions. Still, a communication with the TMS may allow anticipatory planning to avoid potentially critical areas in the city. In this paper, we show how communication between TMS and delivery companies results in benefits for both parties. To exploit the provided information, we develop a dynamic routing policy anticipating potential future measures of the TMS. We analyze our algorithm in a comprehensive case study for the TMS of the city of Braunschweig, Germany, a city often used as reference for a typical European city layout. We show that for the delivery company, integrating the TMS’ information in their routing algorithms reduces the driving times significantly. For the TMS, providing the information results in less traffic in the polluted areas.     

A predictive dynamic traffic assignment model in congested capacity-constrained road networks

In this paper, a predictive dynamic traffic assignment model in congested capacity-constrained road networks is formulated. A traffic simulator is developed to incrementally load the traffic demand onto the network, and updates the traffic conditions dynamically. A time-dependent shortest path algorithm is also given to determine the paths with minimum actual travel time from an origin to all the destinations. The traffic simulator and time-dependent shortest path algorithm are employed in a method of successive averages to solve the dynamic equilibrium solution of the problem. A numerical example is given to illustrate the effectiveness of the proposed method.     

Modelling heavy vehicle car‐following behaviour in congested traffic conditions

This study develops a car‐following model in which heavy vehicle behaviour is predicted separately from passenger car. Heavy vehicles have different characteristics and manoeuvrability compared with passenger cars. These differences could create problems in freeway operations and safety under congested traffic conditions (level of service E and F) particularly when there is high proportion of heavy vehicles. With increasing numbers of heavy vehicles in the traffic stream, model estimates of the traffic flow could be degrades because existing car‐following models do not differentiate between these vehicles and passenger cars. This study highlighted some of the differences in car‐following behaviour of heavy vehicle and passenger drivers and developed a model considering heavy vehicles. In this model, the local linear model tree approach was used to incorporate human perceptual imperfections into a car‐following model. Three different real world data sets from a stretch of freeway in USA were used in this study. Two of them were used for the training and testing of the model, and one of them was used for evaluation purpose. The performance of the model was compared with a number of existing car‐following models. The results showed that the model, which considers the heavy vehicle type, could predict car‐following behaviour of drivers better than the existing models. Copyright © 2013 John Wiley & Sons, Ltd.     

Developing control strategies for freeway merging points under congested traffic situations using modeling and a simulation approach

This work focuses on developing a variety of strategies for alleviating congestion at freeway merging points as well as improving the safety of these points. 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 characteristic 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 extensive study has been undertaken to investigate traffic behavior and characteristics during the merging process under congested situations in order to design safer and less congested merging points as well as to apply more efficient control at these bottleneck sections. Two groups of strategies were investigated in this study. The First group was related to the traffic characteristics, and the second group to the geometric characteristics. In the first group, the control strategies related to closure of freeway and ramp lanes as well as lane‐changing maneuver restriction were investigated through a simulation program, detector data, and field experiment. In the second group, the angle of convergence of the ramp with the freeway in relation to merging capacity was analyzed using a simulation program. Results suggested the potential benefits of using proposed strategies developed in this work and can serve as initial guidance for the reduction of delay and improvement of safety under congested traffic conditions.     

Integrating a simplified emission estimation model and mesoscopic dynamic traffic simulator to efficiently evaluate emission impacts of traffic management strategies

This paper presents a computationally efficient and theoretically rigorous dynamic traffic assignment (DTA) model and its solution algorithm for a number of emerging emissions and fuel consumption related applications that require both effective microscopic and macroscopic traffic stream representations. The proposed model embeds a consistent cross-resolution traffic state representation based on Newell’s simplified kinematic wave and linear car following models. Tightly coupled with a computationally efficient emission estimation package MOVES Lite, a mesoscopic simulation-based dynamic network loading framework DTALite is adapted to evaluate traffic dynamics and vehicle emission/fuel consumption impact of different traffic management strategies.     

Multimodal,multiclass stochastic dynamic traffic assignment for evaluating information provision strategies

A multimodal, multiclass stochastic dynamic traffic assignment model was developed to evaluate pre‐trip and enroute travel information provision strategies. Three different information strategies were examined: user optimum [UO], system optimum [SO] and mixed optimum [MO]. These information provision strategies were analyzed based on the levels of traffic congestion and market penetration rate for the information equipment. Only two modes, bus and car, were used for evaluating and calculating the modal split ratio. Several scenarios were analyzed using day‐to‐day and within day dynamic models. From the results analyzed, it was found that when a traffic manager provides information for drivers using the UO strategy and drivers follow the provided information absolutely, the total travel time may increases over the case with no information. Such worsening occurs when drivers switch their routes and face traffic congestion on the alternative route. This phenomenon is the 'Braess Paradox'.     

Speed-flow relations and cost functions for congested traffic: Theory and empirical analysis

A dynamic ‘car-following’ extension of the conventional economic model of traffic congestion is presented, which predicts the average cost function for trips in stationary states to be significantly different from the conventional average cost function derived from the speed-flow function. When applied to a homogeneous road, the model reproduces the same stationary state equilibria as the conventional model, including the hypercongested ones. However, stability analysis shows that the latter are dynamically unstable. The average cost function for stationary state traffic coincides with the conventional function for non-hypercongested traffic, but rises vertically at the road’s capacity due to queuing, instead of bending backwards. When extending the model to include an upstream road segment, it predicts that such queuing will occur under hypercongested conditions, while the general shape of the average cost function for full trips does not change, implying that hypercongestion will not occur on the downstream road segment. These qualitative predictions are verified empirically using traffic data from a Dutch bottleneck. Finally, it is shown that reduced-form average cost functions, that relate the sum of average travel cost and average schedule delay costs to the number of users in a dynamic equilibrium, certainly need not have the intuitive convex shape, but may very well be concave – despite the fact that the underlying speed-flow function may be convex.     

A shockwave profile model for traffic flow on congested urban arterials

In this paper a new traffic flow model for congested arterial networks, named shockwave profile model (SPM), is presented. Taking advantage of the fact that traffic states within a congested link can be simplified as free-flow, saturated, and jammed conditions, SPM simulates traffic dynamics by analytically deriving the trajectories of four major shockwaves: queuing, discharge, departure, and compression waves. Unlike conventional macroscopic models, in which space is often discretized into small cells for numerical solutions, SPM treats each homogeneous road segment with constant capacity as a section; and the queuing dynamics within each section are described by tracing the shockwave fronts. SPM is particularly suitable for simulating traffic flow on congested signalized arterials especially with queue spillover problems, where the steady-state periodic pattern of queue build-up and dissipation process may break down. Depending on when and where spillover occurs along a signalized arterial, a large number of queuing patterns may be possible. Therefore it becomes difficult to apply the conventional approach directly to track shockwave fronts. To overcome this difficulty, a novel approach is proposed as part of the SPM, in which queue spillover is treated as either extending a red phase or creating new smaller cycles, so that the analytical solutions for tracing the shockwave fronts can be easily applied. Since only the essential features of arterial traffic flow, i.e., queue build-up and dissipation, are considered, SPM significantly reduces the computational load and improves the numerical efficiency. We further validated SPM using real-world traffic signal data collected from a major arterial in the Twin Cities. The results clearly demonstrate the effectiveness and accuracy of the model. We expect that in the future this model can be applied in a number of real-time applications such as arterial performance prediction and signal optimization.     

A model of traffic dispersion from a congested road

The study of traffic flow dynamics is developed by defining and clarifying traffic divergence, continuity, congestion and dispersion. Velocity potential is introduced as a gravity function generated by the interaction of two or more motorists occupying neighbouring points in space and describes interference to continuous traffic flow. The relationship between the potential function and carrying capacity is developed and dispersion, when considered as a random walk, satisfies a diffusion equation. A model of traffic dispersion along a maximum congested road in space and time is presented as eigenfunctions of the velocity potential. This suggests that traffic can be dispersed by a series of quantum steps. A probability density function is introduced to define the probability of locating a motorist in a congestion zone.     

A comparison of stochastic and deterministic traffic assignment over congested networks

The similarity between link flows obtained from deterministic and stochastic equilibrium traffic assignment models is investigated at different levels of congestion. A probit-based stochastic assignment is used (over a congested network) where the conditions for equilibrium are those given by Daganzo and Sheffi (1977). Stochastic equilibrium flows are generated using an iterative procedure with predetermined step sizes, and the resulting assignment is validated on the basis of the equilibrium criteria. The procedure is intended to assist in the choice of the most appropriate assignment algorithm for a given level of congestion.     

Validation of traffic flow models with respect to the spatiotemporal evolution of congested traffic patterns

We propose a quantitative approach for calibrating and validating key features of traffic instabilities based on speed time series obtained from aggregated data of a series of neighboring stationary detectors. The approach can be used to validate models that are calibrated by other criteria with respect to their collective dynamics. We apply the proposed criteria to historic traffic databases of several freeways in Germany containing about 400 occurrences of congestions thereby providing a reference for model calibration and quality assessment with respect to the spatiotemporal dynamics. First tests with microscopic and macroscopic models indicate that the criteria are both robust and discriminative, i.e., clearly distinguishes between models of higher and lower predictive power.     

Performance evaluation of general finite line source model for Delhi traffic conditions

The applicability of General Finite Line Source Model (GFLSM), based on the Gaussian diffusion equation, was assessed by comparing predicted CO concentrations with the measured values obtained from the experiments conducted by Central Pollution Control Board (CPCB), New Delhi, India at three traffic intersections in the Delhi city. Using the CPCB data, a Delhi Finite Line Source Model (DFLSM) has been developed by modifying the GFLSM, considering the existing traffic and meteorological conditions in the Delhi city. The predicted and observed CO concentration data reveals that the DFLSM model works more accurately for the existing traffic and meteorological conditions in the Delhi city in comparison to the GFLSM.     

Scheduling lane conversions for bus use on city-wide scales and in time-varying congested traffic

The paper explores what can occur when select street lanes throughout a city are periodically reserved for buses. Simulations of an idealized city were performed to that end. The city’s time-varying travel demand was studied parametrically. In all cases, queues formed throughout the city during a rush, and dissipated during the off-peak period that followed. Bus lanes were activated all at once across the city, and were eventually deactivated in like fashion. Activation and deactivation schedules varied parametrically as well. Schedules that roughly balanced the trip-time savings to bus riders against the added delays to car travelers were thus identified.Findings reveal why activating conversions near the start of a rush can degrade travel, both by car and by bus. Balance was struck by instead activating lane conversions nearer the end of the rush, when vehicle accumulation in the city was at or near its maximum. Most of the time savings to bus riders accrued after the conversions had been left in place for only 30 min. Leaving them for longer durations often brought modest additional savings to bus travelers. Yet, the added delays to cars often grew large as a result.These findings held even when buses garnered high ridership shares. This was the case when lane conversions gradually induced new bus trips among residents who formerly did not travel. It was also true when high ridership was a pre-existing feature of the city. Activating conversions a bit earlier in a rush was found to make sense only if commuters shifted from cars to buses in very large numbers. Findings also unveiled how to fine-tune activation and deactivation schedules to suit a city’s congestion level. Guidelines for scheduling conversions in real settings are furnished. So is discussion on how these schedules might be adapted to daily variations in city-wide traffic states. Roles for technology are discussed as well.     

Development and evaluation of a knowledge-based system for traffic congestion management and control

This paper describes a real-time knowledge-based system (KBS) for decision support to Traffic Operation Center personnel in the selection of integrated traffic control plans after the occurrence of non-recurring congestion, on freeway and arterial networks. The uniqueness of the system, called TCM, lies in its ability to cooperate with the operator, by handling different sources of input data and inferred knowledge, and providing an explanation of its reasoning process. A data fusion algorithm for the analysis of congestion allows to represent and interpret different types of data, with various levels of reliability and uncertainty, to provide a clear assessment of traffic conditions. An efficient algorithm for the selection of control plans determines alternative traffic control responses. These are proposed to an operator, along with an explanation of the reasoning process that led to their development and an estimation of their expected effect on traffic. The validation of the system, which is one of only few examples of validation of a KBS in transportation, demonstrates the validity of the approach. The evaluation results, in a simulated environment demonstrate the ability of TCM to reduce congestion, through the formulation of traffic diversion and control schemes.     

Practical modelling of trip re-scheduling under congested conditions

There is plenty of evidence that drivers may make small changes in their time of travel to take advantage of lower levels of congestion. However, progress in the practical modelling of such “micro” re-scheduling within peak period traffic remains slow. While there exist research papers describing theoretical solutions, techniques for practical use are not generally available. Most commonly used assignment programs are temporally aggregate, while packages which do allow some “dynamic assignment” typically assume a fixed demand profile.The aim of the paper is to present a more heuristic method which could at least be used on an interim basis. The assumption is that the demand profile can be segmented into a number of mutually exclusive “windows” in relation to the “preferred arrival time”, while on the assignment side, independently defined sequential “timeslices” are used in order to respect some of the dynamic processes relating to the build-up of queues. The demand process, whereby some drivers shift away from their preferred window, leads to an iterative procedure with the aim of achieving reasonable convergence.Using the well-known scheduling theory developed by Vickrey, Small, and Arnott, de Palma & Lindsey, the basic approach can be described, extending from the simple “bottleneck”, to which the theory was originally applied, to a general network. So far, insufficient research funds have been made available to test the approach properly. It is hoped that by bringing the ideas into the public domain, further research into this area may be stimulated.     

A dynamic Bayesian network model for real-time crash prediction using traffic speed conditions data

Traffic crashes occurring on freeways/expressways are considered to relate closely to previous traffic conditions, which are time-varying. Meanwhile, most studies use volume/occupancy/speed parameters to predict the likelihood of crashes, which are invalid for roads where the traffic conditions are estimated using speed data extracted from sampled floating cars or smart phones. Therefore, a dynamic Bayesian network (DBN) model of time sequence traffic data has been proposed to investigate the relationship between crash occurrence and dynamic speed condition data. Moreover, the traffic conditions near the crash site were identified as several state combinations according to the level of congestion and included in the DBN model. Based on 551 crashes and corresponding speed information collected on expressways in Shanghai, China, DBN models were built with time series speed condition data and different state combinations. A comparative analysis of the DBN model using flow detector data and a static Bayesian network model was also conducted. The results show that, with only speed condition data and nine traffic state combinations, the DBN model can achieve a crash prediction accuracy of 76.4% with a false alarm rate of 23.7%. In addition, the results of transferability testing imply that the DBN models are applicable to other similar expressways with 67.0% crash prediction accuracy.     

Estimation of origin-destination matrices from link traffic counts on congested networks

Conventional methods for estimating origin-destination (O-D) trip matrices from link traffic counts assume that route choice proportions are given constants. In a network with realistic congestion levels, this assumption does not hold. This paper shows how existing methods such as the generalized least squares technique can be integrated with an equilibrium traffic assignment in the form of a convex bilevel optimization problem. The presence of measurement errors and time variations in the observed link flows are explicitly considered. The feasibility of the model is always guaranteed without a requirement for estimating consistent link flows from counts. A solution algorithm is provided and numerical simulation experiments are implemented in investigating the model's properties. Some related problems concerning O-D matrix estimation are also discussed.     

Capturing value of reliability through road pricing in congested traffic under uncertainty

Empirical studies showed that travel time reliability, usually measured by travel time variance, is strongly correlated with travel time itself. Travel time is highly volatile when the demand approaches or exceeds the capacity. Travel time variability is associated with the level of congestion, and could represent additional costs for travelers who prefer punctual arrivals. Although many studies propose to use road pricing as a tool to capture the value of travel time (VOT) savings and to induce better road usage patterns, the role of the value of reliability (VOR) in designing road pricing schemes has rarely been studied. By using road pricing as a tool to spread out the peak demand, traffic management agencies could improve the utility of travelers who prefer punctual arrivals under traffic congestion and stochastic network conditions. Therefore, we could capture the value of travel time reliability using road pricing, which is rarely discussed in the literature. To quantify the value of travel time reliability (or reliability improvement), we need to integrate trip scheduling, endogenous traffic congestion, travel time uncertainty, and pricing strategies in one modeling framework. This paper developed such a model to capture the impact of pricing on various costs components that affect travel choices, and the role of travel time reliability in shaping departure patterns, queuing process, and the choice of optimal pricing. The model also shows the benefits of improving travel time reliability in various ways. Findings from this paper could help to expand the scope of road pricing, and to develop more comprehensive travel demand management schemes.     

System performance and user response under real-time information in a congested traffic corridor

A modelling framework is developed to analyze the effect of in-vehicle real time information strategies on the performance of a congested traffic communing corridor. The framework consists of a special-purpose simulation component and a user decisions component that determines users' responses to the supplied information. The user decisions component is microscopic and determines individual commuters' route switching, at any node of the network, as a function of the supplied information. The traffic simulation component moves vehicles in bundles or macroparticles at the prevailing local speeds, as determined by macroscopic traffic relations. The framework allows the investigation of system performance under alternative behavioral response mechanisms, as well as under different information strategies. Results are presented for simulation experiments in a commuting corridor with a special network structure that simplifies the network computations. The results illustrate the effect of the fraction of users equipped with in-vehicle navigation systems on overall system performance. In addition, alternative assumptions on user response reflecting varying degrees of optimizing behavior are explored. The modelling framework is shown to provide a useful approach for addressing key questions of interest in the design of real time in-vehicle information system.