Surrogate‐based optimization of cordon toll levels in congested traffic networks

The benefit, in terms of social surplus, from introducing congestion charging schemes in urban networks is depending on the design of the charging scheme. The literature on optimal design of congestion pricing schemes is to a large extent based on static traffic assignment, which is known for its deficiency in correctly predict travel times in networks with severe congestion. Dynamic traffic assignment can better predict travel times in a road network, but are more computational expensive. Thus, previously developed methods for the static case cannot be applied straightforward. Surrogate‐based optimization is commonly used for optimization problems with expensive‐to‐evaluate objective functions. In this paper, we evaluate the performance of a surrogate‐based optimization method, when the number of pricing schemes, which we can afford to evaluate (because of the computational time), are limited to between 20 and 40. A static traffic assignment model of Stockholm is used for evaluating a large number of different configurations of the surrogate‐based optimization method. Final evaluation is performed with the dynamic traffic assignment tool VisumDUE, coupled with the demand model Regent, for a Stockholm network including 1240 demand zones and 17 000 links. Our results show that the surrogate‐based optimization method can indeed be used for designing a congestion charging scheme, which return a high social surplus. Copyright © 2016 John Wiley & Sons, Ltd.     

Nonlinear gating control for urban road traffic network using the network fundamental diagram

This work proposes a nonlinear model predictive controller for the urban gating problem. The system model is formalized based on a research on existing models of the network fundamental diagram and the perimeter control systems. For the existing models, modifications are suggested: additional state variables are allocated to describe the queue dynamics at the network gates. Using the extended model, a nonlinear model predictive controller is designed offering a ‘non‐greedy’ policy compared with previous, ‘greedy’ gating control designs. The greedy and non‐greedy nonlinear model predictive control (NMPC) controllers are compared with a greedy linear feedback proportional‐integral‐derivative (PID) controller in different traffic situations. The proposed non‐greedy NMPC controller outperforms the other two approaches in terms of travel distance performance and queue lengths. The performance results justify the consideration of queue lengths in dynamic modeling, and the use of NMPC approach for controller design. Copyright © 2014 John Wiley & Sons, Ltd.     

Model-based predictive control for bicycling in urban intersections

In this paper, a model predictive control approach for improving the efficiency of bicycling as part of intermodal transportation systems is proposed. Considering a dedicated bicycle lanes infrastructure, the focus in this paper is to optimize the dynamic interaction between bicycles and vehicles at the multimodal urban traffic intersections. In the proposed approach, a dynamic model for the flows, queues, and number of both vehicles and bicycles is explicitly incorporated in the controller. For obtaining a good trade-off between the total time spent by the cyclists and by the drivers, a Pareto analysis is proposed to adjust the objective function of the MPC controller. Simulation results for a two-intersections urban traffic network are presented and the controller is analyzed considering different methods of including in the MPC controller the inflow demands of both vehicles and bicycles.     

Modelling public transport on‐board congestion: comparing schedule‐based and agent‐based assignment approaches and their implications

Transit systems are subject to congestion that influences system performance and level of service. The evaluation of measures to relieve congestion requires models that can capture their network effects and passengers' adaptation. In particular, on‐board congestion leads to an increase of crowding discomfort and denied boarding and a decrease in service reliability. This study performs a systematic comparison of alternative approaches to modelling on‐board congestion in transit networks. In particular, the congestion‐related functionalities of a schedule‐based model and an agent‐based transit assignment model are investigated, by comparing VISUM and BusMezzo, respectively. The theoretical background, modelling principles and implementation details of the alternative models are examined and demonstrated by testing various operational scenarios for an example network. The results suggest that differences in modelling passenger arrival process, choice‐set generation and route choice model yield systematically different passenger loads. The schedule‐based model is insensitive to a uniform increase in demand or decrease in capacity when caused by either vehicle capacity or service frequency reduction. In contrast, nominal travel times increase in the agent‐based model as demand increases or capacity decreases. The marginal increase in travel time increases as the network becomes more saturated. Whilst none of the existing models capture the full range of congestion effects and related behavioural responses, existing models can support different planning decisions. Copyright © 2016 John Wiley & Sons, Ltd.     

Visco‐elastic traffic flow model

To increase our understanding of the operations of traffic system, a visco‐elastic traffic model was proposed in analogy of non‐Newtonian fluid mechanics. The traffic model is based on mass and momentum conservations, and includes a constitutive relation similar to that of linear visco‐elastic fluids. The further inclusion of the elastic effect allows us to describe a high‐order traffic model more comprehensively because the use of relaxation time indicates that vehicle drivers adjust their time headway in a reasonable and safe range. The self‐organizing behaviour is described by introducing the effects of pressure and visco‐elasticity from the point of view in fluid mechanics. Both the viscosity and elasticity can be determined by using the relaxation time and the traffic sound speed. The sound speed can be approximately represented by the road operational parameters including the free‐flow speed, the jam density, and the density of saturation if the jam pressure in traffic flows is identical to the total pressure at the flow saturation point. A linear stability analysis showed that the traffic flow should be absolutely unstable for disturbances with short spatial wavelengths. There are two critical points of regime transition in traffic flows. The first point happens at the density of saturation, and the second point occurs at a density relating on the sound speed and the fundamental diagram of traffic flows. By using a triangular form flow–density relation, a numerical test based on the new model is carried out for congested traffic flows on a loop road without ramp effect. The numerical results are discussed and compared with the result of theoretical analysis and observation data of traffic flows. Copyright © 2011 John Wiley & Sons, Ltd.     

An intersection turning movement estimation procedure based on path flow estimator

Estimation of intersection turning movements is one of the key inputs required for a variety of transportation analysis, including intersection geometric design, signal timing design, traffic impact assessment, and transportation planning. Conventional approaches that use manual techniques for estimation of turning movements are insensitive to congestion. The drawbacks of the manual techniques can be amended by integrating a network traffic model with a computation procedure capable of estimating turning movements from a set of link traffic counts and intersection turning movement counts. This study proposes using the path flow estimator, originally used to estimate path flows (hence origin–destination flows), to derive not only complete link flows, but also turning movements for the whole road network given some counts at selected roads and intersections. Two case studies using actual traffic counts are used to demonstrate the proposed intersection turning movement estimation procedure. Copyright © 2010 John Wiley & Sons, Ltd.     

A maximum entropy-least squares estimator for elastic origin-destination trip matrix estimation

In transportation subnetwork-supernetwork analysis, it is well known that the origin-destination (O-D) flow table of a subnetwork is not only determined by trip generation and distribution, but also a result from traffic routing and diversion, due to the existence of internal-external, external-internal and external-external flows. This result indicates the variable nature of subnetwork O-D flows. This paper discusses an elastic O-D flow table estimation problem for subnetwork analysis. The underlying assumption is that each cell of the subnetwork O-D flow table contains an elastic demand function rather than a fixed demand rate and the demand function can capture all traffic diversion effect under various network changes. We propose a combined maximum entropy-least squares estimator, by which O-D flows are distributed over the subnetwork in terms of the maximum entropy principle, while demand function parameters are estimated for achieving the least sum of squared estimation errors. While the estimator is powered by the classic convex combination algorithm, computational difficulties emerge within the algorithm implementation until we incorporate partial optimality conditions and a column generation procedure into the algorithmic framework. Numerical results from applying the combined estimator to a couple of subnetwork examples show that an elastic O-D flow table, when used as input for subnetwork flow evaluations, reflects network flow changes significantly better than its fixed counterpart.     

Multi‐level traffic control at large four‐leg roundabouts

Yield control and full signalization are typical traffic control solutions that can be used at large roundabouts. In the face of increasing congestion issues, it is preferred to use yield control during off‐peak periods and full signalization during peak periods. To automatically accommodate time‐varying vehicular demands, a multi‐level traffic control (MTC) is developed to implement hybrid yield control and fully actuated control at large four‐leg roundabouts. With new application of traffic control devices and traffic detection system, the right‐of‐way can be assigned to entering and circulating vehicles in three modes. The ‘all entering’ mode is equivalent to a yield control. The ‘no entering’ and ‘concurrent entering’ modes are equivalent to a fully actuated control. On the basis of time headways and occupancy times that are detected on the entry and circulatory roadways, the mode of right‐of‐way assignment can be changed in response to actual traffic conditions. For a specific mode of right‐of‐way assignment, traffic signal operation is managed by some detectable traffic events that are happening. The results of the simulation experiments conducted by VISSIM indicated that: (i) MTC was stabilized at the ‘all entering’ mode during off‐peak periods and at the ‘concurrent entering’ mode during peak periods; (ii) MTC would typically change the mode of right‐of‐way assignment according to actual traffic conditions as vehicular demands increased from off‐peak to peak or decreased from peak to off‐peak; and (iii) statistically speaking, MTC inherited the operational advantages of yield control and fully actuated control, and could be effective in improving the operational performance of large four‐leg roundabouts for all hours of the day, regardless of the level of left‐turn ratios. Copyright © 2016 John Wiley & Sons, Ltd.     

Adaptive traffic signal control with actor-critic methods in a real-world traffic network with different traffic disruption events

The transportation demand is rapidly growing in metropolises, resulting in chronic traffic congestions in dense downtown areas. Adaptive traffic signal control as the principle part of intelligent transportation systems has a primary role to effectively reduce traffic congestion by making a real-time adaptation in response to the changing traffic network dynamics. Reinforcement learning (RL) is an effective approach in machine learning that has been applied for designing adaptive traffic signal controllers. One of the most efficient and robust type of RL algorithms are continuous state actor-critic algorithms that have the advantage of fast learning and the ability to generalize to new and unseen traffic conditions. These algorithms are utilized in this paper to design adaptive traffic signal controllers called actor-critic adaptive traffic signal controllers (A-CATs controllers).The contribution of the present work rests on the integration of three threads: (a) showing performance comparisons of both discrete and continuous A-CATs controllers in a traffic network with recurring congestion (24-h traffic demand) in the upper downtown core of Tehran city, (b) analyzing the effects of different traffic disruptions including opportunistic pedestrians crossing, parking lane, non-recurring congestion, and different levels of sensor noise on the performance of A-CATS controllers, and (c) comparing the performance of different function approximators (tile coding and radial basis function) on the learning of A-CATs controllers. To this end, first an agent-based traffic simulation of the study area is carried out. Then six different scenarios are conducted to find the best A-CATs controller that is robust enough against different traffic disruptions. We observe that the A-CATs controller based on radial basis function networks (RBF (5)) outperforms others. This controller is benchmarked against controllers of discrete state Q-learning, Bayesian Q-learning, fixed time and actuated controllers; and the results reveal that it consistently outperforms them.     

A bi‐level programming approach — Optimal transit fare under line capacity constraints

The fare of a transit line is one of the important decision variables for transit network design. It has been advocated as an efficient means of coordinating the transit passenger flows and of alleviating congestion in the transit network. This paper shows how transit fare can be optimized so as to balance the passenger flow on the transit network and to reduce the overload delays of passengers at transit stops. A bi‐level programming method is developed to optimize the transit fare under line capacity constraints. The upper‐level problem seeks to minimize the total network travel time, while the lower‐level problem is a stochastic user equilibrium transit assignment model with line capacity constraints. A heuristic solution algorithm based on sensitivity analysis is proposed. Numerical example is used to illustrate the application of the proposed model and solution algorithm.     

The treatment of uncertainty in the dynamic origin–destination estimation problem using a fuzzy approach

Regardless of existing types of transportation and traffic model and their applications, the essential input to these models is travel demand, which is usually described using origin–destination (OD) matrices. Due to the high cost and time required for the direct development of such matrices, they are sometimes estimated indirectly from traffic measurements recorded from the transportation network. Based on an assumed demand profile, OD estimation problems can be categorized into static or dynamic groups. Dynamic OD demand provides valuable information on the within-day fluctuation of traffic, which can be employed to analyse congestion dissipation. In addition, OD estimates are essential inputs to dynamic traffic assignment (DTA) models. This study presents a fuzzy approach to dynamic OD estimation problems. The problems are approached using a two-level model in which demand is estimated in the upper level and the lower level performs DTA via traffic simulation. Using fuzzy rules and the fuzzy C-Mean clustering approach, the proposed method treats uncertainty in historical OD demand and observed link counts. The approach employs expert knowledge to model fitted link counts and to set boundaries for the optimization problem by defining functions in the fuzzification process. The same operation is performed on the simulation outputs, and the entire process enables different types of optimization algorithm to be employed. The Box-complex method is utilized as an optimization algorithm in the implementation of the approach. Empirical case studies are performed on two networks to evaluate the validity and accuracy of the approach. The study results for a synthetic network and a real network demonstrate the robust performance of the proposed method even when using low-quality historical demand data.     

Short‐term traffic flow prediction with linear conditional Gaussian Bayesian network

Traffic flow prediction is an essential part of intelligent transportation systems (ITS). Most of the previous traffic flow prediction work treated traffic flow as a time series process only, ignoring the spatial relationship from the upstream flows or the correlation with other traffic attributes like speed and density. In this paper, we utilize a linear conditional Gaussian (LCG) Bayesian network (BN) model to consider both spatial and temporal dimensions of traffic as well as speed information for short‐term traffic flow prediction. The LCG BN allows both continuous and discrete variables, which enables the consideration of categorical variables in traffic flow prediction. A microscopic traffic simulation dataset is used to test the performance of the proposed model compared to other popular approaches under different predicting time intervals. In addition, the authors investigate the importance of spatial data and speed data in flow prediction by comparing models with different levels of information. The results indicate that the prediction accuracy will increase significantly when both spatial data and speed data are included. Copyright © 2016 John Wiley & Sons, Ltd.     

Network equilibrium for congested multi‐mode networks with elastic demand

This paper proposes an elastic demand network equilibrium model for networks with transit and walking modes. In Hong Kong, the multi‐mode transit system services over 90% of the total journeys and the demand on it is continuously increasing. Transit and walking modes are related to each other as transit passengers have to walk to and from transit stops. In this paper, the multi‐mode elastic‐demand network equilibrium problem is formulated as a variational inequality problem where the combined mode and route choices are modeled in a hierarchical logit structures and the total travel demand for each origin‐destination pair is explicitly given by an elastic demand function. In addition, the capacity constraint for transit vehicles and the effects of bi‐directional flows on walkways are considered in the proposed model. All these congestion effects are taken into account for modeling the travel choices. A solution algorithm is developed to solve the multi‐mode elastic‐demand network equilibrium model. It is based on a Block Gauss‐Seidel decomposition approach coupled with the method of successive averages. A numerical example is used to illustrate the application of the proposed model and solution algorithm.     

A reliability‐based traffic assignment model for multi‐modal transport network under demand uncertainty

In densely populated and congested urban areas, the travel times in congested multi‐modal transport networks are generally varied and stochastic in practice. These stochastic travel times may be raised from day‐to‐day demand fluctuations and would affect travelers' route and mode choice behaviors according to their different expectations of on‐time arrival. In view of these, this paper presents a reliability‐based user equilibrium traffic assignment model for congested multi‐modal transport networks under demand uncertainty. The stochastic bus frequency due to the unstable travel time of bus route is explicitly considered. By the proposed model, travelers' route and mode choice behaviors are intensively explored. In addition, a stochastic state‐augmented multi‐modal transport network is adopted in this paper to effectively model probable transfers and non‐linear fare structures. A numerical example is given to illustrate the merits of the proposed model. Copyright © 2012 John Wiley & Sons, Ltd.     

Queue length estimation at metered freeway‐to‐freeway connectors

Freeway‐to‐freeway connector metering is a cost‐effective and proven freeway management strategy for relieving recurrent congestion. However, one of the critical challenges in design and operation of freeway‐to‐freeway connector metering is the lack of up‐to‐date queue storage length design guidance. In this study, it was found that ramp queue is dynamically related to the metering rate, on‐ramp demand, and traffic flow arrival pattern. Hence, simply using an average demand cannot provide accurate queue length estimation and is also not suitable for queue storage design where the maximum or a percentile queue length is generally used. A mesoscopic queue length simulation model was developed based on the input–output method for estimating queue lengths under various demand‐to‐capacity ratio scenarios. Simulation results indicate that for under‐saturated situations, the ramp queue may exist temporally due to the random short‐term surge of traffic arrivals, and the exponential function could best capture the relationship between queue length and demand‐to‐capacity ratio. For over‐saturated situations, the ramp queue tends to prolong linearly with the demand‐to‐capacity ratio. Based on the simulation, it was recommended that queue storage length be designed as 4.3% of on‐ramp demand when demand is lower than 1200 vph or 2.3% when demand is between 1200 and 2400 vph. Copyright © 2016 John Wiley & Sons, Ltd.     

Conflict‐free time‐based trajectory planning for aircraft taxi automation with refined taxiway modeling

To mitigate airport congestion caused by increasing air traffic demand, the trajectory‐based surface operations concept has been proposed to improve surface movement efficiency while maintaining safety. It utilizes decision support tools to provide optimized time‐based trajectories for each aircraft and uses automation systems to guide surface movements and monitor their conformance with assigned trajectories. Whether the time‐based trajectories can be effectively followed so that the expected benefits can be guaranteed depends firstly on whether these trajectories are realistic. So, this paper first deals with the modeling biases of the network model typically used for taxi trajectory planning via refined taxiway modeling. Then it presents a zone control‐based dynamic routing and timing algorithm upon the refined taxiway model to find the shortest time taxi route and timings for an aircraft. Finally, the presented algorithm is integrated with a sequential planning framework to continuously decide taxi routes and timings. Experimental results demonstrate that the solution time for an aircraft can be steadily around a few milliseconds with timely cleaning of expired time windows, showing potential for real‐time decision support applications. The results also show the advantages of the proposed methodology over existing approaches. Copyright © 2015 John Wiley & Sons, Ltd.     

Time-dependent congestion pricing system for large networks: Integrating departure time choice,dynamic traffic assignment and regional travel surveys in the Greater Toronto Area

Congestion pricing is one of the widely contemplated methods to manage traffic congestion. The purpose of congestion pricing is to manage traffic demand generation and supply allocation by charging fees (i.e., tolling) for the use of certain roads in order to distribute traffic demand more evenly over time and space. This study presents a framework for large-scale variable congestion pricing policy determination and evaluation. The proposed framework integrates departure time choice and route choice models within a regional dynamic traffic assignment (DTA) simulation environment. The framework addresses the impact of tolling on: (1) road traffic congestion (supply side), and (2) travelers’ choice dimensions including departure time and route choices (demand side). The framework is applied to a simulation-based case study of tolling a major freeway in Toronto while capturing the regional effects across the Greater Toronto Area (GTA). The models are developed and calibrated using regional household travel survey data that reflect the heterogeneity of travelers’ attributes. The DTA model is calibrated using actual traffic counts from the Ontario Ministry of Transportation and the City of Toronto. The case study examined two tolling scenarios: flat and variable tolling. The results indicate that: (1) more benefits are attained from variable pricing, that mirrors temporal congestion patterns, due to departure time rescheduling as opposed to predominantly re-routing only in the case of flat tolling, (2) widespread spatial and temporal re-distributions of traffic demand are observed across the regional network in response to tolling a significant, yet relatively short, expressway serving Downtown Toronto, and (3) flat tolling causes major and counterproductive rerouting patterns during peak hours, which was observed to block access to the tolled facility itself.     

Online calibration of an integrated framework for information‐based evacuation operations

This study seeks to online calibrate the parameters of aggregate evacuee behavior models used in a behavior‐consistent information‐based control module for determining information strategies for real‐time evacuation operations. It enables the deployment of an operational framework for mass evacuation that integrates three aspects underlying an evacuation operation: demand (evacuee behavior), supply (network management), and disaster characteristics. To attain behavior‐consistency, the control module factors evacuees' likely responses to the disseminated information in determining information‐based control strategies. Hence, the ability of the behavior models to predict evacuees' likely responses is critical to the effectiveness of traffic routing by information strategies. The mixed logit structure is used for the aggregate behavior models to accommodate the behavioral heterogeneity across the population. An online calibration problem is proposed to calibrate the random parameters in the behavior models by using the least square estimator to minimize the gap between the predicted network flows and unfolding traffic dynamics. Background traffic, an important but rarely studied issue for modeling evacuation traffic, is also accounted for in the proposed problem. Numerical experiments are conducted to illustrate the importance of the calibration problem for addressing the system consistency issues and integrating the demand, supply, and disaster characteristics for more efficient evacuation operations. Copyright © 2016 John Wiley & Sons, Ltd.     

An instantaneous kinematic wave theory of diverging traffic

Diverging junctions are an important type of bottlenecks, which can reduce capacities and initiate and propagate traffic congestion in a road network. In this paper, we propose a kinematic wave theory for modeling dynamics of non-cooperative diverging traffic, in which traffic dynamics of vehicles to one direction are assumed to be independent of those to other directions instantaneously. During a short time interval, the kinematic wave model of diverging traffic is decoupled into a number of nonlinear resonant systems. From analytical solutions to the Riemann problem of a decoupled system, a new definition of partial traffic demand is introduced, so that diverging flows can be easily computed with the supply–demand method. Then a Cell Transmission Model is proposed to solve the kinematic wave model of diverging traffic by taking into account of the interactions among different traffic streams. Simulation results demonstrate that vehicles follow the First-In-First-Out principle in the long run, and the model converges when we decrease the cell and time-step sizes. In addition, it is shown that traffic streams to different directions segregate in a selfish manner, and the total throughput of a diverging junction is not maximized as in existing diverge models. In the future, more theoretical and empirical studies are needed for a better understanding of this and other diverge models.     

Urban traffic flow prediction: a spatio‐temporal variable selection‐based approach

Short‐term traffic flow prediction in urban area remains a difficult yet important problem in intelligent transportation systems. Current spatio‐temporal‐based urban traffic flow prediction techniques trend aims to discover the relationship between adjacent upstream and downstream road segments using specific models, while in this paper, we advocate to exploit the spatial and temporal information from all available road segments in a partial road network. However, the available traffic states can be high dimensional for high‐density road networks. Therefore, we propose a spatio‐temporal variable selection‐based support vector regression (VS‐SVR) model fed with the high‐dimensional traffic data collected from all available road segments. Our prediction model can be presented as a two‐stage framework. In the first stage, we employ the multivariate adaptive regression splines model to select a set of predictors most related to the target one from the high‐dimensional spatio‐temporal variables, and different weights are assigned to the selected predictors. In the second stage, the kernel learning method, support vector regression, is trained on the weighted variables. The experimental results on the real‐world traffic volume collected from a sub‐area of Shanghai, China, demonstrate that the proposed spatio‐temporal VS‐SVR model outperforms the state‐of‐the‐art. Copyright © 2015 John Wiley & Sons, Ltd.