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.     

Route Choice Models Used in the Stochastic User Equilibrium Problem: A Review

Several route choice models are reviewed in the context of the stochastic user equilibrium problem. The traffic assignment problem has been extensively studied in the literature. Several models were developed focusing mainly on the solution of the link flow pattern for congested urban areas. The behavioural assumption governing route choice, which is the essential part of any traffic assignment model, received relatively much less attention. The core of any traffic assignment method is the route choice model. In the wellknown deterministic case, a simple choice model is assumed in which drivers choose their best route. The assumption of perfect knowledge of travel costs has been long considered inadequate to explain travel behaviour. Consequently, probabilistic route choice models were developed in which drivers were assumed to minimize their perceived costs given a set of routes. The objective of the paper is to review the different route choice models used to solve the traffic assignment problem. Focus is on the different model structures. The paper connects some of the route choice models proposed long ago, such as the logit and probit models, with recently developed models. It discusses several extensions to the simple logit model, as well as the choice set generation problem and the incorporation of the models in the assignment problem.     

Dynamic user equilibrium with side constraints for a traffic network: Theoretical development and numerical solution algorithm

This paper investigates a traffic volume control scheme for a dynamic traffic network model which aims to ensure that traffic volumes on specified links do not exceed preferred levels. The problem is formulated as a dynamic user equilibrium problem with side constraints (DUE-SC) in which the side constraints represent the restrictions on the traffic volumes. Travelers choose their departure times and routes to minimize their generalized travel costs, which include early/late arrival penalties. An infinite-dimensional variational inequality (VI) is formulated to model the DUE-SC. Based on this VI formulation, we establish an existence result for the DUE-SC by showing that the VI admits at least one solution. To analyze the necessary condition for the DUE-SC, we restate the VI as an equivalent optimal control problem. The Lagrange multipliers associated with the side constraints as derived from the optimality condition of the DUE-SC provide the traffic volume control scheme. The control scheme can be interpreted as additional travel delays (either tolls or access delays) imposed upon drivers for using the controlled links. This additional delay term derived from the Lagrange multiplier is compared with its counterpart in a static user equilibrium assignment model. If the side constraint is chosen as the storage capacity of a link, the additional delay can be viewed as the effort needed to prevent the link from spillback. Under this circumstance, it is found that the flow is incompressible when the link traffic volume is equal to its storage capacity. An algorithm based on Euler’s discretization scheme and nonlinear programming is proposed to solve the DUE-SC. Numerical examples are presented to illustrate the mechanism of the proposed traffic volume control scheme.     

Link choice proportions from trip distribution and assignment models: An overview and comparison

A number of estimation procedures have been suggested for the situation where a prior estimate of an origin-destination matrix is to be updated on the basis of recently-acquired traffic counts. These procedures assume that both the link flows and the proportionate usage of each link made by each origin-destination flow (referred to collectively as the link choice proportions) are known. This paper examines the possibility and methods for estimating the link choice proportions. Three methods are presented: (1) using ad hoc iteration between trip distribution and traffic assignment; (2) combining trip distribution and assignment in one step; (3) solving a new optimization problem in which the path flows are directly considered as variables and its optimal solution is governed by a logit type formula. The algorithms, covergencies and computational efficiencies of these methods are investigated. Results of testing the three methods on example networks are discussed.     

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.     

Network user equilibrium of battery electric vehicles considering flow-dependent electricity consumption

This paper addresses the equilibrium traffic assignment problem involving battery electric vehicles (BEVs) with flow-dependent electricity consumption. Due to the limited driving range and the costly/time-consuming recharging process required by current BEVs, as well as the scarce availability of battery charging/swapping stations, BEV drivers usually experience fear that their batteries may run out of power en route. Therefore, when choosing routes, BEV drivers not only try to minimize their travel costs, but also have to consider the feasibility of their routes. Moreover, considering the potential impact of traffic congestion on the electricity consumption of BEVs, the feasibility of routes may be determined endogenously rather than exogenously. A set of user equilibrium (UE) conditions from the literature is first presented to describe the route choice behaviors of BEV drivers considering flow-dependent electricity consumption. The UE conditions are then formulated as a nonlinear complementarity model. The model is further formulated as a variational inequality (VI) model and is solved using an iterative solution procedure. Numerical examples are provided to demonstrate the proposed models and solution algorithms. Discussions of how to evaluate and improve the system performance with non-unique link flow distribution are offered. A robust congestion pricing model is formulated to obtain a pricing scheme that minimizes the system travel cost under the worst-case tolled flow distribution. Finally, a further extension of the mathematical formulation for the UE conditions is provided.     

Bush-based sensitivity analysis for approximating subnetwork diversion

Subnetwork analysis is often used in traffic assignment problems to reduce the size of the network being analyzed, with a corresponding decrease in computation time. This is particularly important in network design, second-best pricing, or other bilevel problems in which many equilibrium runs must be solved as a subproblem to a master optimization program. A fixed trip table based on an equilibrium path flow solution is often used, but this ignores important attraction and diversion effects as drivers (globally) change routes in response to (local) subnetwork changes. This paper presents an approach for replacing a regional network with a smaller one, containing all of the subnetwork, and zones. Artificial arcs are created to represent “all paths” between each origin and subnetwork boundary node, under the assumption that the set of equilibrium routes does not change. The primary contribution of the paper is a procedure for estimating a cost function on these artificial arcs, using derivatives of the equilibrium travel times between the end nodes to create a Taylor series. A bush-based representation allows rapid calculation of these derivatives. Two methods for calculating these derivatives are presented, one based on network transformations and resembling techniques used in the analysis of resistive circuits, and another based on iterated solution of a nested set of linear equations. These methods are applied to two networks, one small and artificial, and the other a regional network representing the Austin, Texas metropolitan area. These demonstrations show substantial improvement in accuracy as compared to using a fixed table, and demonstrate the efficiency of the proposed approach.     

Modeling car-following behavior on urban expressways in Shanghai: A naturalistic driving study

Although car-following behavior is the core component of microscopic traffic simulation, intelligent transportation systems, and advanced driver assistance systems, the adequacy of the existing car-following models for Chinese drivers has not been investigated with real-world data yet. To address this gap, five representative car-following models were calibrated and evaluated for Shanghai drivers, using 2100 urban-expressway car-following periods extracted from the 161,055 km of driving data collected in the Shanghai Naturalistic Driving Study (SH-NDS). The models were calibrated for each of the 42 subject drivers, and their capabilities of predicting the drivers’ car-following behavior were evaluated.The results show that the intelligent driver model (IDM) has good transferability to model traffic situations not presented in calibration, and it performs best among the evaluated models. Compared to the Wiedemann 99 model used by VISSIM®, the IDM is easier to calibrate and demonstrates a better and more stable performance. These advantages justify its suitability for microscopic traffic simulation tools in Shanghai and likely in other regions of China. Additionally, considerable behavioral differences among different drivers were found, which demonstrates a need for archetypes of a variety of drivers to build a traffic mix in simulation. By comparing calibrated and observed values of the IDM parameters, this study found that (1) interpretable calibrated model parameters are linked with corresponding observable parameters in real world, but they are not necessarily numerically equivalent; and (2) parameters that can be measured in reality also need to be calibrated if better trajectory reproducing capability are to be achieved.     

A dynamic empty equipment and crew allocation model for long-haul networks

This research develops a realistic and efficient operational model to optimize empty equipment and crew movements in long-haul trucking networks with consolidation, where returning drivers home within a reasonable amount of time is an important issue. The problem can be stated as follows. On a network of consolidation centers, demand is expressed as a set of trailer-loads that need to be moved between each pair of consolidation centers in each time period and the objective is to optimize trailer, tractor and driver movements while ensuring that drivers return home within a pre-determined period of time. In this paper, a dynamic integer programming model is developed and an efficient approximate solution method is proposed, which involves column generation and branch-and-bound. The algorithm switches from a combination of network and primal simplex to dual simplex to overcome the degeneracy problem, which is very common for dynamic networks. This novel approach enables solving large problems with many intervals. We solved problems with up to 30 nodes and 48 periods successfully by using real data provided by a less-than-truckload company, and by generating statistical forecasts based on the real data.     

A bi-objective cyclist route choice model

It is widely acknowledged that cyclists choose their route differently to drivers of private vehicles. The route choice decision of commuter drivers is often modelled with one objective, to reduce their generalised travel cost, which is a monetary value representing the combined travel time and vehicle operating cost. Commuter cyclists, on the other hand, usually have multiple incommensurable objectives when choosing their route: the travel time and the suitability of a route. By suitability we mean non-subjective factors that characterise the suitability of a route for cycling, including safety, traffic volumes, traffic speeds, presence of bicycle lanes, whether the terrain is flat or hilly, etc. While these incommensurable objectives are difficult to be combined into a single objective, it is also important to take into account that each individual cyclist may prioritise differently between travel time and suitability when they choose a route.This paper proposes a novel model to determine the route choice set of commuter cyclists by formulating a bi-objective routing problem. The two objectives considered are travel time and suitability of a route for cycling. Rather than determining a single route for a cyclist, we determine a choice set of optimal alternative routes (efficient routes) from which a cyclist may select one according to their personal preference depending on their perception of travel time versus other route choice criteria considered in the suitability index. This method is then implemented in a case study in Auckland, New Zealand.The study provides a starting point for the trip assignment of cyclists, and with further research, the bi-objective routing model developed can be applied to create a complete travel demand forecast model for cycle trips. We also suggest the application of the developed methodology as an algorithm in an interactive route finder to suggest efficient route choices at different levels of suitability to cyclists and potential cyclists.     

System dynamics of urban traffic based on its parking-related-states

The urban parking and the urban traffic systems are essential components of the overall urban transportation structure. The short-term interactions between these two systems can be highly significant and influential to their individual performance. The urban parking system, for example, can affect the searching-for-parking traffic, influencing not only overall travel speeds in the network (traffic performance), but also total driven distance (environmental conditions). In turn, the traffic performance can also affect the time drivers spend searching for parking, and ultimately, parking usage. In this study, we propose a methodology to model macroscopically such interactions and evaluate their effects on urban congestion.The model is built on a matrix describing how, over time, vehicles in an urban area transition from one parking-related state to another. With this model it is possible to estimate, based on the traffic and parking demand as well as the parking supply, the amount of vehicles searching for parking, the amount of vehicles driving on the network but not searching for parking, and the amount of vehicles parked at any given time. More importantly, it is also possible to estimate the total (or average) time spent and distance driven within each of these states. Based on that, the model can be used to design and evaluate different parking policies, to improve (or optimize) the performance of both systems.A simple numerical example is provided to show possible applications of this type. Parking policies such as increasing parking supply or shortening the maximum parking duration allowed (i.e., time controls) are tested, and their effects on traffic are estimated. The preliminary results show that time control policies can alleviate the parking-caused traffic issues without the need for providing additional parking facilities. Results also show that parking policies that intend to reduce traffic delay may, at the same time, increase the driven distance and cause negative externalities. Hence, caution must be exercised and multiple traffic metrics should be evaluated before selecting these policies.Overall, this paper shows how the system dynamics of urban traffic, based on its parking-related-states, can be used to efficiently evaluate the urban traffic and parking systems macroscopically. The proposed model can be used to estimate both, how parking availability can affect traffic performance (e.g., average time searching for parking, number of cars searching for parking); and how different traffic conditions (e.g., travel speed, density in the system) can affect drivers ability to find parking. Moreover, the proposed model can be used to study multiple strategies or scenarios for traffic operations and control, transportation planning, land use planning, or parking management and operations.     

Efficient multiple model particle filtering for joint traffic state estimation and incident detection

This article proposes an efficient multiple model particle filter (EMMPF) to solve the problems of traffic state estimation and incident detection, which requires significantly less computation time compared to existing multiple model nonlinear filters. To incorporate the on ramps and off ramps on the highway, junction solvers for a traffic flow model with incident dynamics are developed. The effectiveness of the proposed EMMPF is assessed using a benchmark hybrid state estimation problem, and using synthetic traffic data generated by a micro-simulation software. Then, the traffic estimation framework is implemented using field data collected on Interstate 880 in California. The results show the EMMPF is capable of estimating the traffic state and detecting incidents and requires an order of magnitude less computation time compared to existing algorithms, especially when the hybrid system has a large number of rare models.     

Exact and grid-free solutions to the Lighthill–Whitham–Richards traffic flow model with bounded acceleration for a class of fundamental diagrams

In this article, we propose a new exact and grid-free numerical scheme for computing solutions associated with an hybrid traffic flow model based on the Lighthill–Whitham–Richards (LWR) partial differential equation, for a class of fundamental diagrams. In this hybrid flow model, the vehicles satisfy the LWR equation whenever possible, and have a constant acceleration otherwise. We first propose a mathematical definition of the solution as a minimization problem. We use this formulation to build a grid-free solution method for this model based on the minimization of component function. We then derive these component functions analytically for triangular fundamental diagrams, which are commonly used to model traffic flow. We also show that the proposed computational method can handle fixed or moving bottlenecks. A toolbox implementation of the resulting algorithm is briefly discussed, and posted at https://dl.dropbox.com/u/1318701/Toolbox.zip.     

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.     

Feedback control strategy of a new car-following model based on reducing traffic accident rates

ABSTRACT

To reduce the traffic accident death rate effectively and alleviate the traffic congestion phenomenon, this study proposes a new type of car-following model under the influence of drivers’ time-varying delay response time. Based on Lyapunov function theory, this paper reduces the traffic accident rate problem to the stability issues of the new model. By constructing suitable Lyapunov functions and using the linear matrix inequality method, the stability problem of the new car-following model is studied. The model, under the action of the controller, can effectively restrain traffic congestion. Using the traffic accident rate model proposed by Solomon, compared with the car-following model without the controller, the model under the controller shows a stronger convergence. This also means that the traffic congestion phenomenon has been effectively suppressed while greatly reducing the mortality rate of traffic accidents.     

Routing aspects of electric vehicle drivers and their effects on network performance

This study investigates the routing aspects of battery electric vehicle (BEV) drivers and their effects on the overall traffic network performance. BEVs have unique characteristics such as range limitation, long battery recharging time, and recuperation of energy lost during the deceleration phase if equipped with regenerative braking system (RBS). In addition, the energy consumption rate per unit distance traveled is lower at moderate speed than at higher speed. This raises two interesting questions: (i) whether these characteristics of BEVs will lead to different route selection compared to conventional internal combustion engine vehicles (ICEVs), and (ii) whether such route selection implications of BEVs will affect the network performance. With the increasing market penetration of BEVs, these questions are becoming more important. This study formulates a multi-class dynamic user equilibrium (MCDUE) model to determine the equilibrium flows for mixed traffic consisting of BEVs and ICEVs. A simulation-based solution procedure is proposed for the MCDUE model. In the MCDUE model, BEVs select routes to minimize the generalized cost which includes route travel time, energy related costs and range anxiety cost, and ICEVs to minimize route travel time. Results from numerical experiments illustrate that BEV drivers select routes with lower speed to conserve and recuperate battery energy while ICEV drivers select shortest travel time routes. They also illustrate that the differences in route choice behavior of BEV and ICEV drivers can synergistically lead to reduction in total travel time and the network performance towards system optimum under certain conditions.     

Intelligent transportation system and traffic safety – drivers perception and acceptance of electronic speed checkers

Intelligent Transportation System (ITS) can play an important role in reducing risks and increasing traffic safety. Discussion as to whether a technological approach or a behavioral approach is the right way to achieve a safer traffic environment forms a point of departure for this paper. On the one hand, there are the technicians who emphasize technology as the way towards safer traffic. Behaviorists, on the other hand, view the drivers’ behavior as fundamental and argue that education and incentive-oriented policies are essential in order to influence the driver and therefore increase traffic safety. Independent of the approach advocated a successful outcome of either a technological improvement, or an information campaign, has to be based on a high level of acceptance among potential users. In order to increase traffic safety, it is therefore essential to recognize driver motivation and attitudes. In this paper we focus on drivers’ attitudes towards risk, traffic safety and safety measures. A study of drivers’ attitudes and acceptance of an electronic device for speed checking (which the drivers tested for nine months) indicated a high acceptance level. The drivers perceived that they had both become more aware of traffic regulations and behaved in accordance with safety regulations.     

Categorization of the lane change decision process on freeways

Traffic operations for new road layouts are often simulated using microscopic traffic simulation packages. These traffic simulation packages usually simulate traffic on freeways by a combination of a car-following model and a lane change model. The car-following models have gained attention of researchers and are well calibrated versus data. The proposed lane change models are often representations of assumed reasonable behavior, not necessarily corresponding to reality. The current simulation packages apply solely one specific type of model for car-following or lane changing for all vehicles during the simulation. This paper investigates the decision process of lane changing maneuvers for a variety of drivers based on a two-stage test-drive. Participants are asked to take a drive on a freeway in the Netherlands in a camera-equipped vehicle. Afterwards, the drivers are asked to comment on their choices related to lane and speed choice, while watching the video. This paper reveals that different drivers have completely different strategies to choose lanes, and the choices to change lane are related to their speed choice. Four distinct strategies are empirically found. These strategies differ not only in parameter values, as is currently being modeled in most simulation packages, but also in their reasoning. Most remarkably, all drivers perceive their strategy as an obvious behavior and expect all other drivers to drive in a similar way. In addition to the interviews of the participants in the test-drive, 11 people who did not take part in the experiment were interviewed and questioned on lane change decisions. Moreover, the findings of this study have been presented to various groups of audience with different backgrounds (about 150 people). Their comments and feedback on the derived driving strategies have added some value to this study. The findings in this paper form a starting point for developing a novel lane change model which considers four different driving strategies among the drivers on freeway. This is a significant contribution in the area of driving behavior modeling, since the existing microscopic simulators consider only one type of lane change models for all drivers during the simulation. This could lead to significant changes in the way lane changes on freeways are modeled.     

A computational model for the probit‐based dynamic stochastic user optimal traffic assignment problem

This paper focuses on computational model development for the probit‐based dynamic stochastic user optimal (P‐DSUO) traffic assignment problem. We first examine a general fixed‐point formulation for the P‐DSUO traffic assignment problem, and subsequently propose a computational model that can find an approximated solution of the interest problem. The computational model includes four components: a strategy to determine a set of the prevailing routes between each origin–destination pair, a method to estimate the covariance of perceived travel time for any two prevailing routes, a cell transmission model‐based traffic performance model to calculate the actual route travel time used by the probit‐based dynamic stochastic network loading procedure, and an iterative solution algorithm solving the customized fixed‐point model. The Ishikawa algorithm is proposed to solve the computational model. A comparison study is carried out to investigate the efficiency and accuracy of the proposed algorithm with the method of successive averages. Two numerical examples are used to assess the computational model and the algorithm proposed. Results show that Ishikawa algorithm has better accuracy for smaller network despite requiring longer computational time. Nevertheless, it could not converge for larger network. Copyright © 2010 John Wiley & Sons, Ltd.     

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.