Dynamic user optimal traffic assignment on congested multidestination networks

An equivalent continuous time optimal control problem is formulated to predict the temporal evolution of traffic flow pattern on a congested multiple origin-destination network, corresponding to a dynamic generalization of Wardropian user equilibrium. Optimality conditions are derived using the Pontryagin minimum principle and given economic interpretations, which are generalizations of similar results previously reported for single-destination networks. Analyses of sufficient conditions for optimality and of singular controls are also given. Under the steady-state assumptions, the model is shown to be a proper dynamic extension of Beckmann's mathematical programming problem for a static user equilibrium traffic assignment.     

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.     

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 dynamic behavioural traffic assignment model with strategic agents

Foresee traffic conditions and demand is a major issue nowadays that is very often approached using simulation tools. The aim of this work is to propose an innovative strategy to tackle such problem, relying on the presentation and analysis of a behavioural dynamic traffic assignment.The proposal relies on the assumption that travellers take routing policies rather than paths, leading us to introduce the possibility for each simulated agent to apply, in real time, a strategy allowing him to possibly re-route his path depending on the perceived local traffic conditions, jam and/or time already spent in his journey.The re-routing process allows the agents to directly react to any change in the road network. For the sake of simplicity, the agents’ strategy is modelled with a simple neural network whose parameters are determined during a preliminary training stage. The inputs of such neural network read the local information about the route network and the output gives the action to undertake: stay on the same path or modify it. As the agents use only local information, the overall network topology does not really matter, thus the strategy is able to cope with large and not previously explored networks.Numerical experiments are performed on various scenarios containing different proportions of trained strategic agents, agents with random strategies and non strategic agents, to test the robustness and adaptability to new environments and varying network conditions. The methodology is also compared against existing approaches and real world data. The outcome of the experiments suggest that this work-in-progress already produces encouraging results in terms of accuracy and computational efficiency. This indicates that the proposed approach has the potential to provide better tools to investigate and forecast drivers’ choice behaviours. Eventually these tools can improve the delivery and efficiency of traffic information to the drivers.     

A combined activity/travel choice model for congested road networks with queues

This paper presents a combined activity/travel choice model and proposes a flow-swapping method for obtaining the model's dynamic user equilibrium solution on congested road network with queues. The activities of individuals are characterized by given temporal utility profiles. Three typical activities, which can be observed in morning peak period, namely at-home activity, non-work activity on the way from home to workplace and work-purpose activity, will be considered in the model. The former two activities always occur together with the third obligatory activity. These three activities constitute typical activity/travel patterns in time-space dimension. At the equilibrium, each combined activity/travel pattern, in terms of chosen location/route/departure time, should have identical generalized disutility (or utility) experienced actually. This equilibrium can be expressed as a discrete-time, finite-dimensional variational inequality formulation and then converted to an equivalent "zero-extreme value" minimization problem. An algorithm, which iteratively adjusts the non-work activity location, corresponding route and departure time choices to reach an extreme point of the minimization problem, is proposed. A numerical example with a capacity constrained network is used to illustrate the performance of the proposed model and solution algorithm.     

A dynamic traffic assignment model for a continuum transportation system

A predictive continuum dynamic user-optimal (PDUO-C) model is formulated in this study to investigate the dynamic characteristics of traffic flow and the corresponding route-choice behavior of travelers within a region with a dense urban road network. The modeled region is arbitrary in shape with a single central business district (CBD) and travelers continuously distributed over the region. Within this region, the road network is represented as a continuum and travelers patronize a two-dimensional continuum transportation system to travel to the CBD. The PDUO-C model is solved by a promising solution algorithm that includes elements of the finite volume method (FVM), the finite element method (FEM), and the explicit total variation diminishing Runge-Kutta (TVD-RK) time-stepping method. A numerical example is given to demonstrate the utility of the proposed model and the effectiveness of the solution algorithm in solving this PDUO-C problem.     

A phenomenological model for dynamic traffic flow in networks

A macroscopic model for dynamic traffic flow is presented. The main goal of the model is the real time simulation of large freeway networks with multiple sources and sinks. First, we introduce the model in its discrete formulation and consider some of its properties. It turns out, that our non-hydrodynamical ansatz for the flows results in a very advantageous behavior of the model. Next the fitting conditions at junctions of a traffic network are discussed. In the following sections we carry out a continuous approximation of our discrete model in order to derive stationary solutions and to consider the stability of the homogeneous one. It turns out, that for certain conditions unstable traffic flow occurs. In a subsequent section, we compare the stability of the discrete model and the corresponding continuous approximation. This confirms in retrospection the close similarities of both model versions. Finally we compare the results of our model with the results of another macroscopic model, that was recently suggested by Kerner and Konhäuser [Phys. Rev. E 48, 2335–2338 (1993)].     

Node modeling for congested urban road networks

First-order network flow models are coupled systems of differential equations which describe the build-up and dissipation of congestion along network road segments, known as link models. Models describing flows across network junctions, referred to as node models, play the role of the coupling between the link models and are responsible for capturing the propagation of traffic dynamics through the network. Node models are typically stated as optimization problems, so that the coupling between the link dynamics is not known explicitly. This renders network flow models analytically intractable. This paper examines the properties of node models for urban networks. Solutions to node models that are free of traffic holding, referred to as holding-free solutions, are formally defined and it is shown that flow maximization is only a sufficient condition for holding-free solutions. A simple greedy algorithm is shown to produce holding-free solutions while also respecting the invariance principle. Staging movements through nodes in a manner that prevents conflicting flows from proceeding through the nodes simultaneously is shown to simplify the node models considerably and promote unique solutions. The staging also models intersection capacities in a more realistic way by preventing unrealistically large flows when there is ample supply in the downstream and preventing artificial blocking when some of the downstream supplies are restricted.     

A macro model for traffic flow on road networks with varying road conditions

In this paper, we develop a macro traffic flow model with consideration of varying road conditions. Our analytical and numerical results illustrate that good road condition can enhance the speed and flow of uniform traffic flow whereas bad road condition will reduce the speed and flow. The numerical results also show that good road condition can smooth shock wave and improve the stability of traffic flow whereas bad road condition will lead to steeper shock wave and reduce the stability of traffic flow. Our results are also qualitatively accordant with empirical results, which implies that the proposed model can qualitatively describe the effects of road conditions on traffic flow. These results can guide traffic engineers to improve the road quality in traffic engineering. Copyright © 2012 John Wiley & Sons, Ltd.     

A dynamic traffic assignment model for the assessment of moving bottlenecks

Moving bottlenecks in highway traffic are defined as a situation in which a slow-moving vehicle, be it a truck hauling heavy equipment or an oversized vehicle, or a long convey, disrupts the continuous flow of the general traffic. The effect of moving bottlenecks on traffic flow is an important factor in the evaluation of network performance. This effect, though, cannot be assessed properly by existing transportation tools, especially when the bottleneck travels relatively long distances in the network.This paper develops a dynamic traffic assignment (DTA) model that can evaluate the effects of moving bottlenecks on network performance in terms of both travel times and traveling paths. The model assumes that the characteristics of the moving bottleneck, such as traveling path, physical dimensions, and desired speed, are predefined and, therefore, suitable for planned conveys.The DTA model is based on a mesoscopic simulation network-loading procedure with unique features that allow assessing the special dynamic characteristics of a moving bottleneck. By permitting traffic density and speed to vary along a link, the simulation can capture the queue caused by the moving bottleneck while preserving the causality principles of traffic dynamics.     

Induced road traffic in Spanish regions: A dynamic panel data model

Distinguishing between traffic generated exclusively from the expansion of the road network (induced demand) and that resulting from other demand factors is of crucial importance to properly designed transport policies. This paper analyzes and quantifies the induced demand for road transport for Spain’s main regions from 1998 to 2006, years that saw mobility in Spain attain its highest growth rate. The lack of research in this area involving Spain and the key role played by the sector, given its high level of energy consumption and the negative externalities associated with it (accidents, noise, traffic congestion, emissions, etc.), endow greater relevance to this type of research. Based on a Dynamic Panel Data (DPD) reduced-form model, we apply alternative approaches (fixed and random effects and GMM-based methods) for measuring the induced demand. The results obtained provide evidence for the existence of an induced demand for transport in Spain, though said results vary depending on the estimating method employed.     

A cell-based Merchant-Nemhauser model for the system optimum dynamic traffic assignment problem

A cell-based variant of the Merchant-Nemhauser (M-N) model is proposed for the system optimum (SO) dynamic traffic assignment (DTA) problem. Once linearized and augmented with additional constraints to capture cross-cell interactions, the model becomes a linear program that embeds a relaxed cell transmission model (CTM) to propagate traffic. As a result, we show that CTM-type traffic dynamics can be derived from the original M-N model, when the exit-flow function is properly selected and discretized. The proposed cell-based M-N model has a simple constraint structure and cell network representation because all intersections and cells are treated uniformly. Path marginal costs are defined using a recursive formula that involves a subset of multipliers from the linear program. This definition is then employed to interpret the necessary condition, which is a dynamic extension of the Wardrop’s second principle. An algorithm is presented to solve the flow holding back problem that is known to exist in many discrete SO-DTA models. A numerical experiment is conducted to verify the proposed model and algorithm.     

A congested and dwell time dependent transit corridor assignment model

This research proposes an equilibrium assignment model for congested public transport corridors in urban areas. In this model, journey times incorporate the effect of bus queuing on travel times and boarding and alighting passengers on dwell times at stops. The model also considers limited bus capacity leading to longer waiting times and more uncomfortable journeys. The proposed model is applied to an example network, and the results are compared with those obtained in a recent study. This is followed by the analysis and discussion of a real case application in Santiago de Chile. Finally, different boarding and alighting times and different vehicle types are evaluated. In all cases, demand on express services tends to be underestimated by using constant dwell time assignment models, leading to potential planning errors for these lines. The results demonstrate the importance of considering demand dependent dwell times in the assignment process, especially at high demand levels when the capacity constraint should also be considered. Copyright © 2017 John Wiley & Sons, Ltd.     

A dynamic stochastic assignment model for the analysis of general networks

The paper adopts the framework employed by the existing dynamic assignment models, which analyse specific network forms, and develops a methodology for analysing general networks. Traffic conditions within a link are assumed to be homogeneous, and the time varying O-D travel times and traffic flow patterns are calculated using elementary relationships from traffic flow theory and link volume conservation equations. Each individual is assumed to select a departure time and a route by trading off the travel time and schedule delay associated with each alternative. A route is considered as reasonable if it includes only links which do not take the traveller back to the origin. The set of reasonable routes is not consistant but depends on the time that an individual decides to depart from his origin. Equilibrium distributions are derived from a Markovian model which describes the evolution of travel patterns from day to day. Numerical simulation experiments are conducted to analyse the impact of different work start time flexibilities on the time dependent travel patterns. The similarity between link flows and travel times obtained from static and dynamic stochastic assignment is investigated. It is shown that in congested networks the application of static assignment results in travel times which are lower than the ones predicted by dynamic assignment.     

Spillback congestion in dynamic traffic assignment: A macroscopic flow model with time-varying bottlenecks

In this paper, we propose a new model for the within-day Dynamic Traffic Assignment (DTA) on road networks where the simulation of queue spillovers is explicitly addressed, and a user equilibrium is expressed as a fixed-point problem in terms of arc flow temporal profiles, i.e., in the infinite dimension space of time’s functions. The model integrates spillback congestion into an existing formulation of the DTA based on continuous-time variables and implicit path enumeration, which is capable of explicitly representing the formation and dispersion of vehicle queues on road links, but allows them to exceed the arc length. The propagation of congestion among adjacent arcs will be achieved through the introduction of time-varying exit and entry capacities that limit the inflow on downstream arcs in such a way that their storage capacities are never exceeded. Determining the temporal profile of these capacity constraints requires solving a system of spatially non-separable macroscopic flow models on the supply side of the DTA based on the theory of kinematic waves, which describe the dynamic of the spillback phenomenon and yield consistent network performances for given arc flows. We also devise a numerical solution algorithm of the proposed continuous-time formulation allowing for “long time intervals” of several minutes, and give an empirical evidence of its convergence. Finally, we carry out a thorough experimentation in order to estimate the relevance of spillback modeling in the context of the DTA, compare the proposed model in terms of effectiveness with the Cell Transmission Model, and assess the efficiency of the proposed algorithm and its applicability to real instances with large networks.     

Stochastic cell transmission model (SCTM): A stochastic dynamic traffic model for traffic state surveillance and assignment

The paper proposes a first-order macroscopic stochastic dynamic traffic model, namely the stochastic cell transmission model (SCTM), to model traffic flow density on freeway segments with stochastic demand and supply. The SCTM consists of five operational modes corresponding to different congestion levels of the freeway segment. Each mode is formulated as a discrete time bilinear stochastic system. A set of probabilistic conditions is proposed to characterize the probability of occurrence of each mode. The overall effect of the five modes is estimated by the joint traffic density which is derived from the theory of finite mixture distribution. The SCTM captures not only the mean and standard deviation (SD) of density of the traffic flow, but also the propagation of SD over time and space. The SCTM is tested with a hypothetical freeway corridor simulation and an empirical study. The simulation results are compared against the means and SDs of traffic densities obtained from the Monte Carlo Simulation (MCS) of the modified cell transmission model (MCTM). An approximately two-miles freeway segment of Interstate 210 West (I-210W) in Los Ageles, Southern California, is chosen for the empirical study. Traffic data is obtained from the Performance Measurement System (PeMS). The stochastic parameters of the SCTM are calibrated against the flow-density empirical data of I-210W. Both the SCTM and the MCS of the MCTM are tested. A discussion of the computational efficiency and the accuracy issues of the two methods is provided based on the empirical results. Both the numerical simulation results and the empirical results confirm that the SCTM is capable of accurately estimating the means and SDs of the freeway densities as compared to the MCS.     

Multi-agent model predictive control of signaling split in urban traffic networks

The operation of large dynamic systems such as urban traffic networks remains a challenge in control engineering to a great extent due to their sheer size, intrinsic complexity, and nonlinear behavior. Recently, control engineers have looked for unconventional means for modeling and control of complex dynamic systems, in particular the technology of multi-agent systems whose appeal stems from their composite nature, flexibility, and scalability. This paper contributes to this evolving technology by proposing a framework for multi-agent control of linear dynamic systems, which decomposes a centralized model predictive control problem into a network of coupled, but small sub-problems that are solved by the distributed agents. Theoretical results ensure convergence of the distributed iterations to a globally optimal solution. The framework is applied to the signaling split control of traffic networks. Experiments conducted with simulation software indicate that the multi-agent framework attains performance comparable to conventional control. The main advantages of the multi-agent framework are its graceful extension and localized reconfiguration, which require adjustments only in the control strategies of the agents in the vicinity.     

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.     

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.     

New technology and the modeling of risk-taking behavior in congested road networks

Intelligent transport systems provide various means to improve traffic congestion in road networks. Evaluation of the benefits of these improvements requires consideration of commuters’ response to reliability and/or uncertainty of travel time under various circumstances. Various disruptions cause recurrent or non-recurrent congestion on road networks, which make road travel times intrinsically fluctuating and unpredictable. Confronted with such uncertain traffic conditions, commuters are known to develop some simple decision-making process to adjust their travel choices. This paper represents the decision-making process involved in departure-time and route choices as risk-taking behavior under uncertainty. An expected travel disutility function associated with commuters’ departure-time and route choices is formulated with taking into account the travel delay (due the recurrent congestion), the uncertainty of travel times (due to incident-induced congestion) and the consequent early or late arrival penalty. Commuters are assumed to make decision on the departure-time and route choices on the basis of the minimal expected travel disutility. Thus the network will achieve a simultaneous route and departure-time user equilibrium, in which no commuter can decrease his or her expected disutility by unilaterally changing the route or departure-time. The equilibrium is further formulated as an equivalent nonlinear complementarity problem and is then converted into an unconstrained minimization problem with the use of a gap function suggested recently. Two algorithms based on the Nelder–Mead multidimensional simplex method and the heuristic route/time-swapping approach, are adapted to solve the problem. Finally, numerical example is given to illustrate the application of the proposed model and algorithms.