A mesoscopic model for large-scale simulation of pedestrian dynamics

A mesoscopic pedestrian model is proposed, considering pedestrians as individuals and describing their movement by means of aggregate density-flow relationships. The model builds on a stochastic process, describing transition rates among adjacent sites on a lattice. Each lattice can contain several pedestrians. The approach is minimal and fast to simulate, and, by construction, capable of capturing population heterogeneity as well as variability in walking behaviour and en-route path choice. The model is more efficient than microscopic models, and potentially more accurate than macroscopic ones. We calibrate and validate the model using real data and carry out several numerical experiments to present its key properties and possible applications for simulation of large-scale scenarios.     

Network traffic control based on a mesoscopic dynamic flow model

The paper focuses on Network Traffic Control based on aggregate traffic flow variables, aiming at signal settings which are consistent with within-day traffic flow dynamics. The proposed optimisation strategy is based on two successive steps: the first step refers to each single junction optimisation (green timings), the second to network coordination (offsets). Both of the optimisation problems are solved through meta-heuristic algorithms: the optimisation of green timings is carried out through a multi-criteria Genetic Algorithm whereas offset optimisation is achieved with the mono-criterion Hill Climbing algorithm. To guarantee proper queuing and spillback simulation, an advanced mesoscopic traffic flow model is embedded within the network optimisation method. The adopted mesoscopic traffic flow model also includes link horizontal queue modelling. The results attained through the proposed optimisation framework are compared with those obtained through benchmark tools.     

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.     

A comparative study on data segregation for mesoscopic energy modeling

On-road vehicles have been considered as one of the major contributors to energy consumption and air pollutant emissions. In order to quantify the corresponding environmental impacts, great efforts have been dedicated to the microscopic and macroscopic modeling for vehicle energy consumption and emissions. However, the mesoscopic modeling research that is focused on estimating trip-based energy consumption and is critical to some ITS applications (e.g., environmentally-friendly navigation), is relatively deficient. This study aims to investigate the effects of different data segregation methods on the mesoscopic modeling for vehicle energy consumption. A variety of novel methods, including the so-called conditional operating mode based method, have been proposed and evaluated using field data. Based on real-world data, statistical analyses have demonstrated the superior performance of enhanced models (i.e., conditional operating mode/VSP based models) in estimating vehicle energy consumption on a trip basis, compared to the other four models (velocity binning, time snipping, distance snipping and VSP based models) tested in this study.     

Model based urban traffic control,part I: Local model and local model predictive controllers

This paper is the first in a series of reports presenting a framework for the hierarchical design of feedback controllers for traffic lights in urban networks. The goal of the research is to develop an easy to understand methodology for designing model based feedback controllers that use the current state estimate in order to select the next switching times of traffic lights. In this paper we introduce an extension of the cell transmission model that describes with sufficient accuracy the major causes of delay for urban traffic. We show that this model is computationally fast enough such that it can be used in a model predictive controller that decides for each intersection, taking into account the vehicle density as estimated along all links connected to the intersection, what switching time minimizes the local delay for all vehicles over a prediction horizon of a few minutes. The implementation of this local MPC only requires local online measurements and local model information (unlike the coordinated MPC, to be introduced in the next paper in this series, that takes into account interactions between neighbouring intersections). We study the performance of the proposed local MPC via simulation on a simple 4 by 4 Manhattan grid, comparing its delay with an efficiently tuned pretimed control for the traffic lights, and with traffic lights controlled according to the max pressure rule. These simulations show that the proposed local MPC controller achieves a significant reduction in delay for various traffic conditions.     

Model based urban traffic control,part II: Coordinated model predictive controllers

The present paper describes how to use coordination between neighbouring intersections in order to improve the performance of urban traffic controllers. Both the local MPC (LMPC) introduced in the companion paper (Hao et al., 2018) and the coordinated MPC (CMPC) introduced in this paper use the urban cell transmission model (UCTM) (Hao et al., 2018) in order to predict the average delay of vehicles in the upstream links of each intersection, for different scenarios of switching times of the traffic lights at that intersection. The feedback controller selects the next switching times of the traffic light corresponding to the shortest predicted average delay. While the local MPC (Hao et al., 2018) only uses local measurements of traffic in the links connected to the intersection in comparing the performance of different scenarios, the CMPC approach improves the accuracy of the performance predictions by allowing a control agent to exchange information about planned switching times with control agents at all neighbouring intersections. Compared to local MPC the offline information on average flow rates from neighbouring intersections is replaced in coordinated MPC by additional online information on when the neighbouring intersections plan to send vehicles to the intersection under control. To achieve good coordination planned switching times should not change too often, hence a cost for changing planned schedules from one decision time to the next decision time is added to the cost function. In order to improve the stability properties of CMPC a prediction of the sum of squared queue sizes is used whenever some downstream queues of an intersection become too long. Only scenarios that decrease this sum of squares of local queues are considered for possible implementation. This stabilization criterion is shown experimentally to further improve the performance of our controller. In particular it leads to a significant reduction of the queues that build up at the edges of the traffic region under control. We compare via simulation the average delay of vehicles travelling on a simple 4 by 4 Manhattan grid, for traffic lights with pre-timed control, traffic lights using the local MPC controller (Hao et al., 2018), and coordinated MPC (with and without the stabilizing condition). These simulations show that the proposed CMPC achieves a significant reduction in delay for different traffic conditions in comparison to these other strategies.     

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.     

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.     

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

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

A flexible traffic stream model and its three representations of traffic flow

To connect microscopic driving behaviors with the macro-correspondence (i.e., the fundamental diagram), this study proposes a flexible traffic stream model, which is derived from a novel car-following model under steady-state conditions. Its four driving behavior-related parameters, i.e., reaction time, calmness parameter, speed- and spacing-related sensitivities, have an apparent effect in shaping the fundamental diagram. Its boundary conditions and homogenous case are also analyzed in detail and compared with other two models (i.e., Longitudinal Control Model and Intelligent Driver Model). Especially, these model formulations and properties under Lagrangian coordinates provide a new perspective to revisit the traffic flow and complement with those under Eulerian coordinate. One calibration methodology that incorporates the monkey algorithm with dynamic adaptation is employed to calibrate this model, based on real-field data from a wide range of locations. Results show that this model exhibits the well flexibility to fit these traffic data and performs better than other nine models. Finally, a concrete example of transportation application is designed, in which the impact of three critical parameters on vehicle trajectories and shock waves with three representations (i.e., respectively defined in x-t, n-t and x-n coordinates) is tested, and macro- and micro-solutions on shock waves well agree with each other. In summary, this traffic stream model with the advantages of flexibility and efficiency has the good potential in level of service analysis and transportation planning.     

A network enhancement model with integrated lane reorganization and traffic control strategies

Lane reorganization strategies such as lane reversal, one‐way street, turning restriction, and cross elimination have demonstrated their effectiveness in enhancing transportation network capacity. However, how to select the most appropriate combination of those strategies in a network remains challenging to transportation professionals considering the complex interactions among those strategies and their impacts on conventional traffic control components. This article contributes to developing a mathematical model for a traffic equilibrium network, in which optimization of lane reorganization and traffic control strategies are integrated in a unified framework. The model features a bi‐level structure with the upper‐level model describing the decision of the transportation authorities for maximizing the network capacity. A variational inequality (VI) formulation of the user equilibrium (UE) behavior in choosing routes in response to various strategies is developed in the lower level. A genetic algorithm (GA) based heuristic is used to yield meta‐optimal solutions to the model. Results from extensive numerical analyses reveal the promising property of the proposed model in enhancing network capacity and reducing congestion. Copyright © 2016 John Wiley & Sons, Ltd.     

Classification modeling approach for vehicle dynamics model‐integrated traffic simulation assessing surrogate safety

To assess safety impacts of untried traffic control strategies, an earlier study developed a vehicle dynamics model‐integrated (i.e., VISSIM‐CarSim‐SSAM) simulation approach and evaluated its performance using surrogate safety measures. Although the study found that the integrated simulation approach was a superior alternative to existing approaches in assessing surrogate safety, the computation time required for the implementation of the integrated simulation approach prevents it from using it in practice. Thus, this study developed and evaluated two types of models that could replace the integrated simulation approach with much faster computation time, feasible for real‐time implementation. The two models are as follows: (i) a statistical model (i.e., logit model) and (ii) a nonparametric approach (i.e., artificial neural network). The logit model and the neural network model were developed and trained on the basis of three simulation data sets obtained from the VISSIM‐CarSim‐SSAM integrated simulation approach, and their performances were compared in terms of the prediction accuracy. These two models were evaluated using six new simulation data sets. The results indicated that the neural network approach showing 97.7% prediction accuracy was superior to the logit model with 85.9% prediction accuracy. In addition, the correlation analysis results between the traffic conflicts obtained from the neural network approach and the actual traffic crash data collected in the field indicated a statistically significant relationship (i.e., 0.68 correlation coefficient) between them. This correlation strength is higher than that of the VISSIM only (i.e., the state of practice) simulation approach. The study results indicated that the neural network approach is not only a time‐efficient way to implementing the VISSIM‐CarSim‐SSAM integrated simulation but also a superior alternative in assessing surrogate safety. Copyright © 2014 John Wiley & Sons, Ltd.     

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.     

Hierarchical perimeter control with guaranteed stability for dynamically coupled heterogeneous urban traffic

Perimeter control based on the Macroscopic Fundamental Diagram (MFD) is widely developed for alleviating or postponing congestion in a protected region. Recent studies reveal that traffic conditions might not be improved if the perimeter control strategies are applied to unstable systems where high demand generates heavy and heterogeneously distributed traffic congestion. Therefore, considering stability of the targeted traffic system is essential, for the sake of developing a feasible and then optimal control strategy. This paper sheds light on this direction. It integrates a stability characterization algorithm of MFD system equations into the Model Predictive Control (MPC) scheme, and features respectively an upper and a lower bound of the feasible control inputs, to guarantee system stability. Firstly, the dynamics of traffic heterogeneity and its effect on the MFD are analyzed, using real data from Guangzhou in China. Piecewise affine functions of average flow are proposed to capture traffic heterogeneity in both regional and subregional MFDs. Secondly, stability of a three-state two-region system is investigated via stable equilibrium and surface boundaries analysis. Finally, a three-layer hierarchical control strategy is introduced for the studied two-region heterogeneous urban networks. The first layer of the controller calculates the stable surface boundaries for the given traffic demands and then determines the bounds of control input (split rate). An MPC approach in the second layer is used to solve an optimization problem with two objectives of minimizing total network delay and maximizing network throughput. Heterogeneity among the subregions is minimized in the last layer by implementing simultaneously a subregional perimeter flow control and an internal flow control. The effectiveness and stability of the proposed control approach are verified by comparison with four existing perimeter control strategies.     

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.     

Transport demand model estimation from traffic counts

Many problems in transport planning and management tasks require an origindestination (O-D) matrix to represent the travel pattern. However, O-D matrices obtained through a large scale survey such as home or roadside interviews, tend to be costly, labour intensive and time disruptive to trip makers. Therefore, the use of low cost and easily available data is particularly attractive.The need of low-cost methods to estimate current and future O-D matrices is even more valuable in developing countries because of the rapid changes in population, economic activity and land use. Models of transport demand have been used for many years to synthesize O-D matrices in study areas. A typical example of this is the gravity model; its functional form, plus the appropriate values for the parameters involved, is employed to produce acceptable matrices representing trip making behaviour for many trip purposes and time periods.The work reported in this paper has combined the advantages of acceptable travel demand models with the low cost and availability of traffic counts. Three types of demand models have been used: gravity (GR), opportunity (OP) and gravity-opportunity (GO) models. Three estimation methods have been developed to calibrate these models from traffic counts, namely: non-linear-least-squares (NLLS), weighted-non-linear-least-squares (WNLLS) and maximumlikelihood (ML).The 1978 Ripon (urban vehicle movement) survey was used to test these methods. They were found to perform satisfactorily since each calibrated model reproduced the observed O-D matrix fairly closely. The tests were carried out using two assignment techniques, all-or-nothing and the stochastic method due to Burrell, in determining the routes taken through the network.requests for offprints     

Integrating mesoscopic dynamic traffic assignment with agent-based travel behavior models for cumulative land development impact analysis

A number of approaches have been developed to evaluate the impact of land development on transportation infrastructure. While traditional approaches are either limited to static modeling of traffic performance or lack a strong travel behavior foundation, today’s advanced computational technology makes it feasible to model an individual traveler’s response to land development. This study integrates dynamic traffic assignment (DTA) with a positive agent-based microsimulation travel behavior model for cumulative land development impact studies. The integrated model not only enhances the behavioral implementation of DTA, but also captures traffic dynamics. It provides an advanced yet practical approach to understanding the impact of a single or series of land development projects on an individual driver’s behavior, as well as the aggregated impacts on the demand pattern and time-dependent traffic conditions. A simulation-based optimization (SBO) approach is proposed for the calibration of the modeling system. The SBO calibration approach enhances the transferability of this integrated model to other study areas. Using a case study that focuses on the cumulative land development impact along a congested corridor in Maryland, various regional and local travel behavior changes are discussed to show the capability of this tool for behavior side estimations and the corresponding traffic impacts.     

An optimization model for integrated planning of railway traffic and network maintenance

Railway transportation systems are important for society and have many challenging and important planning problems. Train services as well as maintenance of a railway network need to be scheduled efficiently, but have mostly been treated as two separate planning problems. Since these activities are mutually exclusive they must be coordinated and should ideally be planned together. In this paper we present a mixed integer programming model for solving an integrated railway traffic and network maintenance problem. The aim is to find a long term tactical plan that optimally schedules train free windows sufficient for a given volume of regular maintenance together with the wanted train traffic. A spatial and temporal aggregation is used for controlling the available network capacity. The properties of the proposed model are analyzed and computational experiments on various synthetic problem instances are reported. Model extensions and possible modifications are discussed as well as future research directions.     

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.     

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.