Global optimization methods for the discrete network design problem

This paper addresses the discrete network design problem (DNDP) with multiple capacity levels, or multi-capacity DNDP for short, which determines the optimal number of lanes to add to each candidate link in a road network. We formulate the problem as a bi-level programming model, where the upper level aims to minimize the total travel time via adding new lanes to candidate links and the lower level is a traditional Wardrop user equilibrium (UE) problem. We propose two global optimization methods by taking advantage of the relationship between UE and system optimal (SO) traffic assignment principles. The first method, termed as SO-relaxation, exploits the property that an optimal network design solution under SO principle can be a good approximate solution under UE principle, and successively sorts the solutions in the order of increasing total travel time under SO principle. Optimality is guaranteed when the lower bound of the total travel time of the unexplored solutions under UE principle is not less than the total travel time of a known solution under UE principle. The second method, termed as UE-reduction, adds the objective function of the Beckmann-McGuire-Winsten transformation of UE traffic assignment to the constraints of the SO-relaxation formulation of the multi-capacity DNDP. This constraint is convex and strengthens the SO-relaxation formulation. We also develop a dynamic outer-approximation scheme to make use of the state-of-the-art mixed-integer linear programming solvers to solve the SO-relaxation formulation. Numerical experiments based on a two-link network and the Sioux-Falls network are conducted.     

A methodology to control urban traffic noise under the constraint of environmental capacity: A case study of a double-decision optimization model

This paper presents a novel methodology to control urban traffic noise under the constraint of environmental capacity. Considering the upper limits of noise control zones as the major bottleneck to control the maximum traffic flow is a new idea. The urban road network traffic is the mutual or joint behavior of public self-selection and management decisions, so is a typical double decision optimization problem.The proposed methodology incorporates theoretically model specifications. Traffic noise calculation model and traffic assignment model for O–D matrix are integrated based on bi-level programming method which follows an iterated process to obtain the optimal solution. The upper level resolves the question of how to sustain the maximum traffic flow with noise capacity threshold in a feasible road network. The user equilibrium method is adopted in the lower layer to resolve the O–D traffic assignment.The methodology has been applied to study area of QingDao, China. In this illustrative case, the noise pollution level values of optimal solution could satisfy the urban environmental noise capacity constraints. Moreover, the optimal solution was intelligently adjusted rather than simply reducing the value below a certain threshold. The results indicate that the proposed methodology is feasible and effective, and it can provide a reference for a sustainable development and noise control management of the urban traffic.     

Network-oriented household activity pattern problem for system optimization

The recently emerging trend of self-driving vehicles and information sharing technologies, made available by private technology vendors, starts creating a revolutionary paradigm shift in the coming years for traveler mobility applications. By considering a deterministic traveler decision making framework at the household level in congested transportation networks, this paper aims to address the challenges of how to optimally schedule individuals’ daily travel patterns under the complex activity constraints and interactions. We reformulate two special cases of household activity pattern problem (HAPP) through a high-dimensional network construct, and offer a systematic comparison with the classical mathematical programming models proposed by Recker (1995). Furthermore, we consider the tight road capacity constraint as another special case of HAPP to model complex interactions between multiple household activity scheduling decisions, and this attempt offers another household-based framework for linking activity-based model (ABM) and dynamic traffic assignment (DTA) tools. Through embedding temporal and spatial relations among household members, vehicles and mandatory/optional activities in an integrated space-time-state network, we develop two 0–1 integer linear programming models that can seamlessly incorporate constraints for a number of key decisions related to vehicle selection, activity performing and ridesharing patterns under congested networks. The well-structured network models can be directly solved by standard optimization solvers, and further converted to a set of time-dependent state-dependent least cost path-finding problems through Lagrangian relaxation, which permit the use of computationally efficient algorithms on large-scale high-fidelity transportation networks.     

Noise level in the vicinity of signalized roundabouts

The analysis, assessment and estimation of noise levels in the vicinity of intersections is a more complex problem than a similar analysis for roads and streets. This is due to the varied geometry of the intersections, differences in the loads of individual movements, participation of heavy vehicles and mass transport vehicles, as well as the various types of traffic management and traffic control. This article analyses the influence of intersection type and traffic characteristics on the noise levels in the vicinity of classic channelized intersections with signalization, roundabouts and signalized roundabouts. Based on the conducted measurements, it has been established that, with comparable traffic parameters and the same distance from the geometric centre of the intersection, the L_Aeq value for signalized roundabouts is 2.5–10.8 dB higher in comparison to classic channelized intersections with signalization and 3.3–6.7 dB higher in relations to the analysed roundabout. Additionally the differences between L_Aeq levels at individual entries at the same signalized roundabouts may reach the value of approximately 4.5 dB. Such situation is influenced by differences in the intersection geometry, diameter of the intersection’s central island, traffic flow type, traffic management at the entries and traffic volume, especially the amount and traffic movements of multiple axle heavy vehicles. These factors have been analysed in detail in relation to signalized roundabouts in this paper.     

Will technological progress be sufficient to stabilize CO2 emissions from air transport in the mid-term?

This article investigates whether anticipated technological progress can be expected to offset the CO₂ emissions resulting from rapid air traffic growth. Global aviation CO₂ emissions projections are examined for eight geographical zones until 2025. Air traffic flows are forecast using a dynamic panel-data econometric model, and then converted into corresponding quantities of air traffic CO₂ emissions using specific hypotheses and energy factors. None of our nine scenarios appears compatible with the objective of 450 ppm CO₂-eq. recommended by the Intergovernmental Panel on Climate Change. Nor is any compatible with the Panel’s aim of limiting global warming to 3.2 °C.     

A traffic noise model for road intersections in the city of Cartagena de Indias,Colombia

Road traffic noise models are fundamental tools for designing and implementing appropriate prevention plans to minimize and control noise levels in urban areas. The objective of this study is to develop a traffic noise model to simulate the average equivalent sound pressure level at road intersections based on traffic flow and site characteristics, in the city of Cartagena de Indias (Cartagena), Colombia. Motorcycles are included as an additional vehicle category since they represent more than 30% of the total traffic flow and a distinctive source of noise that needs to be characterized. Noise measurements are collected using a sound level meter Type II. The data analysis leads to the development of noise maps and a general mathematical model for the city of Cartagena, Colombia, which correlates the sound levels as a function of vehicle flow within road intersections. The highest noise levels were 79.7 dB(A) for the road intersection María Auxiliadora during the week (business days) and 77.7 dB(A) for the road intersection India Catalina during weekends (non-business days). Although traffic and noise are naturally related, the intersections with higher vehicle flow did not have the highest noise levels. The roadway noise for these intersections in the city of Cartagena exceeds current limit standards. The roadway noise model is able to satisfactorily predict noise emissions for road intersections in the city of Cartagena, Colombia.     

A new algorithm for optimal signal control in congested networks

Optimization of traffic lights in a congested network is formulated as a linear programming problem. The formulation adapted here takes into account particular capacity constraints for road links and for intersections. A necessary prerequisite for the determination of optimal green times is that representative a-priori information about the origin-destination and route choice pattern inside the network is available. Because any particular control strategy temporarily alters the effective turning rates at intersections, an iterative procedure is proposed here which accomplishes convergence of optimal signal control and resulting O-D flows. The efficiency of this optimization procedure is demonstrated in a case study for a network with fifteen intersections.     

A chance-constrained based stochastic dynamic traffic assignment model: Analysis, formulation and solution algorithms

This paper is concerned with the system optimum-dynamic traffic assignment (SO-DTA) problem when the time-dependent demands are random variables with known probability distributions. The model is a stochastic extension of a deterministic linear programming formulation for SO-DTA introduced by Ziliaskopoulos (Ziliaskopoulos, A.K., 2000. A linear programming model for the single destination system optimum dynamic traffic assignment problem, Transportation Science, 34, 1–12). The proposed formulation is chance-constrained based and we demonstrate that it provides a robust SO solution with a user specified level of reliability. The model provides numerous insights and can be a useful tool in producing robust control and management strategies that account for uncertainty in applications where SO-DTA is relevant (e.g. evacuation modeling, computing alternate routes around freeway incidents and establishing lower bounds on network performance).     

A kinematic wave approach to traffic statics and dynamics in a double-ring network

Recently there has been much interest in understanding macroscopic fundamental diagrams of stationary road networks. However, there lacks a systematic method to define and solve stationary states in a road network with complex junctions. In this study we propose a kinematic wave approach to defining, analyzing, and simulating static and dynamic traffic characteristics in a network of two ring roads connected by a 2 × 2 junction, which can be either an uninterrupted interchange or a signalized intersection. This study is enabled by recently developed macroscopic junction models of general junctions. With a junction model based on fair merging and first-in-first-out diverging rules, we first define and solve stationary states and then derive the macroscopic fundamental diagram (MFD) of a stationary uninterrupted network. We conclude that the flow-density relationship of the uninterrupted double-ring network is not unique for high average network densities (i.e., when one ring becomes congested) and unveil the existence of infinitely many stationary states that can arise with a zero-speed shockwave. From simulation results with a corresponding Cell Transmission Model, we verify that all stationary states in the MFD are stable and can be reached, but show that randomness in the retaining ratio of each ring drives the network to more symmetric traffic patterns and higher flow-rates. Furthermore we model a signalized intersection as two alternate diverge junctions and demonstrate that the signalized double-ring network can reach asymptotically periodic traffic patterns, which are therefore defined as “stationary” states in signalized networks. With simulations we show that the flow-density relation is well defined in such “stationary” states, and asymptotic traffic patterns can be impacted by signal cycle lengths and retaining ratios. But compared with uninterrupted interchanges, signalized intersections lead to more asymmetric traffic patterns, lower flow-rates, and even gridlocks when the average density is higher than half of the jam density. The results are consistent between this study and existing studies, but the network kinematic wave model, with appropriate junction models, is mathematically tractable and physically meaningful. It has offered a more complete picture regarding the number and type of stationary states, their stability, and MFD in freeway and signalized networks.     

Limits and perspectives of effective O–D matrix correction using traffic counts

Correction of the O–D matrix from traffic counts is a classical procedure usually adopted in transport engineering by practitioners for improving the overall reliability of transport models. Recently, Papola and Marzano [Papola, A., Marzano, V., 2006. How can we trust in the O–D matrix correction procedure using traffic counts? In: Proceedings of the 2006 ETC Conference, Strasbourg] showed through laboratory experiments that this procedure is generally unable to provide for effective correction of the O–D matrix. From a theoretical standpoint, this result can be justified by the lower number of (stochastic) equations (independent observed link flows) with respect to the unknowns (O–D flows). This paper first confirms that this represents the main reason for the failure of this procedure, showing that satisfactory correction is generally obtained when the number of equations is greater than the number of unknowns. Then, since this circumstance does not occur in practice, where the number of O–D pairs usually far exceeds the number of link counts, we explore alternative assumptions and contexts, allowing for a proper balance between unknowns and equations. This can be achieved by moving to within-day dynamic contexts, where a much larger number of equations are generally available. In order to bound the corresponding increase in the number of unknowns, specific reasonable hypotheses on O–D flow variation across time slices must be introduced. In this respect, we analyze the effectiveness of the O–D matrix correction procedure in the usually adopted linear hypothesis on the dynamic process evolution of O–D flows and under the assumption of constant distribution shares. In the second case it is shown that satisfactory corrections can be performed using a small number of time slices of up to 3 min in length, leading to a time horizon in which the hypothesis of constant distribution shares can be regarded as trustworthy and realistic.     

Stochastic dynamic itinerary interception refueling location problem with queue delay for electric taxi charging stations

A new facility location model and a solution algorithm are proposed that feature (1) itinerary-interception instead of flow-interception; (2) stochastic demand as dynamic service requests; and (3) queueing delay. These features are essential to analyze battery-powered electric shared-ride taxis operating in a connected, centralized dispatch manner. The model and solution method are based on a bi-level, simulation–optimization framework that combines an upper level multiple-server allocation model with queueing delay and a lower level dispatch simulation based on earlier work by Jung and Jayakrishnan. The solution algorithm is tested on a fleet of 600 shared-taxis in Seoul, Korea, spanning 603 km², a budget of 100 charging stations, and up to 22 candidate charging locations, against a benchmark “naïve” genetic algorithm that does not consider cyclic interactions between the taxi charging demand and the charger allocations with queue delay. Results show not only that the proposed model is capable of locating charging stations with stochastic dynamic itinerary-interception and queue delay, but that the bi-level solution method improves upon the benchmark algorithm in terms of realized queue delay, total time of operation of taxi service, and service request rejections. Furthermore, we show how much additional benefit in level of service is possible in the upper-bound scenario when the number of charging stations is unbounded.     

Self-organizing traffic signals using secondary extension and dynamic coordination

Actuated traffic signal control logic has many advantages because of its responsiveness to traffic demands, short cycles, effective use of capacity leading to and recovering from oversaturation, and amenability to aggressive transit priority. Its main drawback has been its inability to provide good progression along arterials. However, the traditional way of providing progression along arterials, coordinated–actuated control with a common, fixed cycle length, has many drawbacks stemming from its long cycle lengths, inflexibility in recovering from priority interruptions, and ineffective use of capacity during periods of oversaturation. This research explores a new paradigm for traffic signal control, “self-organizing signals,” based on local actuated control but with some additional rules that create coordination mechanisms. The primary new rules proposed are for secondary extensions, in which the green may be held to serve an imminently arriving platoon, and dynamic coordination, in which small groups of closely spaced signals communicate with one another to cycle synchronously with the group’s critical intersection. Simulation tests in VISSIM performed on arterial corridors in Massachusetts and Arizona show overall delay reductions of up to 14% compared to an optimized coordinated–actuated scheme where there is no transit priority, and more than 30% in scenarios with temporary oversaturation. Tests also show that with self-organizing control, transit signal priority can be more effective than with coordinated–actuated control, reducing transit delay by about 60%, or 12 to 14 s per intersection with little impact on traffic delay.     

Effects of low speed limits on freeway traffic flow

Recent years have seen a renewed interest in Variable Speed Limit (VSL) strategies. New opportunities for VSL as a freeway metering mechanism or a homogenization scheme to reduce speed differences and lane changing maneuvers are being explored. This paper examines both the macroscopic and microscopic effects of different speed limits on a traffic stream, especially when adopting low speed limits. To that end, data from a VSL experiment carried out on a freeway in Spain are used. Data include vehicle counts, speeds and occupancy per lane, as well as lane changing rates for three days, each with a different fixed speed limit (80 km/h, 60 km/h, and 40 km/h). Results reveal some of the mechanisms through which VSL affects traffic performance, specifically the flow and speed distribution across lanes, as well as the ensuing lane changing maneuvers. It is confirmed that the lower the speed limit, the higher the occupancy to achieve a given flow. This result has been observed even for relatively high flows and low speed limits. For instance, a stable flow of 1942 veh/h/lane has been measured with the 40 km/h speed limit in force. The corresponding occupancy was 33%, doubling the typical occupancy for this flow in the absence of speed limits. This means that VSL strategies aiming to restrict the mainline flow on a freeway by using low speed limits will need to be applied carefully, avoiding conditions as the ones presented here, where speed limits have a reduced ability to limit flows. On the other hand, VSL strategies trying to get the most from the increased vehicle storage capacity of freeways under low speed limits might be rather promising. Additionally, results show that lower speed limits increase the speed differences across lanes for moderate demands. This, in turn, also increases the lane changing rate. This means that VSL strategies aiming to homogenize traffic and reduce lane changing activity might not be successful when adopting such low speed limits. In contrast, lower speed limits widen the range of flows under uniform lane flow distributions, so that, even for moderate to low demands, the under-utilization of any lane is avoided. These findings are useful for the development of better traffic models that are able to emulate these effects. Moreover, they are crucial for the implementation and assessment of VSL strategies and other traffic control algorithms.     

Global optimization method for network design problem with stochastic user equilibrium

In this paper, we consider the continuous road network design problem with stochastic user equilibrium constraint that aims to optimize the network performance via road capacity expansion. The network flow pattern is subject to stochastic user equilibrium, specifically, the logit route choice model. The resulting formulation, a nonlinear nonconvex programming problem, is firstly transformed into a nonlinear program with only logarithmic functions as nonlinear terms, for which a tight linear programming relaxation is derived by using an outer-approximation technique. The linear programming relaxation is then embedded within a global optimization solution algorithm based on range reduction technique, and the proposed approach is proved to converge to a global optimum.     

Dynamic network traffic control

This study developed a dynamic traffic control formulation designated as dynamic intersection signal control optimization (DISCO). Traffic in DISCO is modeled after the cell-transmission model (CTM), which is a convergent numerical approximation to the hydrodynamic model of traffic flow. It considers the entire fundamental diagram and captures traffic phenomena such as shockwaves and queue dynamics. As a dynamic approach, the formulation derives dynamic timing plans for time-variant traffic patterns. We solved DISCO based on a genetic algorithm (GA) approach and applied it to a traffic black spot in Hong Kong that is notorious for severe congestion. For performance comparisons, we also applied TRANSYT to the same scenarios. The Results showed that DISCO outperformed TRANSYT for all the scenarios tested especially in congested traffic. For the congested scenarios, DISCO could reduce delay by as much as 33% when compared with TRANSYT. Even for the uncongested scenarios, DISCO’s delays could be smaller by as much as 23%.     

A multiclass cell transmission model for shared human and autonomous vehicle roads

Autonomous vehicles have the potential to improve link and intersection traffic behavior. Computer reaction times may admit reduced following headways and increase capacity and backwards wave speed. The degree of these improvements will depend on the proportion of autonomous vehicles in the network. To model arbitrary shared road scenarios, we develop a multiclass cell transmission model that admits variations in capacity and backwards wave speed in response to class proportions within each cell. The multiclass cell transmission model is shown to be consistent with the hydrodynamic theory. This paper then develops a car following model incorporating driver reaction time to predict capacity and backwards wave speed for multiclass scenarios. For intersection modeling, we adapt the legacy early method for intelligent traffic management (Bento et al., 2013) to general simulation-based dynamic traffic assignment models. Empirical results on a city network show that intersection controls are a major bottleneck in the model, and that the legacy early method improves over traffic signals when the autonomous vehicle proportion is sufficiently high.     

Multi-scenario optimization approach for assessing the impacts of advanced traffic information under realistic stochastic capacity distributions

In this study, to incorporate realistic discrete stochastic capacity distribution over a large number of sampling days or scenarios (say 30–100 days), we propose a multi-scenario based optimization model with different types of traveler knowledge in an advanced traveler information provision environment. The proposed method categorizes commuters into two classes: (1) those with access to perfect traffic information every day, and (2) those with knowledge of the expected traffic conditions (and related reliability measure) across a large number of different sampling days. Using a gap function framework or describing the mixed user equilibrium under different information availability over a long-term steady state, a nonlinear programming model is formulated to describe the route choice behavior of the perfect information (PI) and expected travel time (ETT) user classes under stochastic day-dependent travel time. Driven by a computationally efficient algorithm suitable for large-scale networks, the model was implemented in a standard optimization solver and an open-source simulation package and further applied to medium-scale networks to examine the effectiveness of dynamic traveler information under realistic stochastic capacity conditions.     

Using nonparametrics to specify a model to measure the value of travel time

Using a range of nonparametric methods, the paper examines the specification of a model to evaluate the willingness-to-pay (WTP) for travel time changes from binomial choice data from a simple time–cost trading experiment. The analysis favours a model with random WTP as the only source of randomness over a model with fixed WTP which is linear in time and cost and has an additive random error term. Results further indicate that the distribution of log WTP can be described as a sum of a linear index fixing the location of the log WTP distribution and an independent random variable representing unobserved heterogeneity. This formulation is useful for parametric modelling. The index indicates that the WTP varies systematically with income and other individual characteristics. The WTP varies also with the time difference presented in the experiment which is in contradiction of standard utility theory.     

Estimation of mean and covariance of peak hour origin–destination demands from day-to-day traffic counts

This paper proposes a generalized model to estimate the peak hour origin–destination (OD) traffic demand variation from day-to-day hourly traffic counts throughout the whole year. Different from the conventional OD estimation methods, the proposed modeling approach aims to estimate not only the mean but also the variation (in terms of covariance matrix) of the OD demands during the same peak hour periods due to day-to-day fluctuation over the whole year. For this purpose, this paper fully considers the first- and second-order statistical properties of the day-to-day hourly traffic count data so as to capture the stochastic characteristics of the OD demands. The proposed model is formulated as a bi-level optimization problem. In the upper-level problem, a weighted least squares method is used to estimate the mean and covariance matrix of the OD demands. In the lower-level problem, a reliability-based traffic assignment model is adopted to take account of travelers’ risk-taking path choice behaviors under OD demand variation. A heuristic iterative estimation-assignment algorithm is proposed for solving the bi-level optimization problem. Numerical examples are presented to illustrate the applications of the proposed model for assessment of network performance over the whole year.     

A dynamic evacuation model for pedestrian–vehicle mixed-flow networks

In urban emergency evacuation, a potentially large number of evacuees may depend either on transit or other modes, or need to walk a long distance, to access their passenger cars. In the process of approaching the designated pick-up points or parking areas for evacuation, the massive number of pedestrians may cause tremendous burden to vehicles in the roadway network. Responsible agencies often need to contend with congestion incurred by massive vehicles emanating from parking garages, evacuation buses generated from bus stops, and the conflicts between evacuees and vehicles at intersections. Hence, an effective plan for such evacuation needs to concurrently address both the multi-modal traffic route assignment and the optimization of network signal controls for mixed traffic flows. This paper presents an integrated model to produce the optimal distribution of vehicle and pedestrian flows, and the responsive network signal plan for massive mixed pedestrian–vehicle flows within the evacuation zone. The proposed model features its effectiveness in accounting for multiple types of evacuation vehicles, the interdependent relations between pedestrian and vehicle flows via some conversion locations, and the inevitable conflicts between intersection turning vehicle and pedestrian flows. An illustrating example concerning an evacuation around the M&T stadium area has been presented, and the results indicate the promising properties of our proposed model, especially on reflecting the complex interactions between vehicle and pedestrian flows and the favorable use of high-occupancy vehicles for evacuation operations.