General stochastic user equilibrium traffic assignment problem with link capacity constraints

This paper addresses a general stochastic user equilibrium (SUE) traffic assignment problem with link capacity constraints. It first proposes a novel linearly constrained minimization model in terms of path flows and then shows that any of its local minimums satisfies the generalized SUE conditions. As the objective function of the proposed model involves path‐specific delay functions without explicit mathematical expressions, its Lagrangian dual formulation is analyzed. On the basis of the Lagrangian dual model, a convergent Lagrangian dual method with a predetermined step size sequence is developed. This solution method merely invokes a subroutine at each iteration to perform a conventional SUE traffic assignment excluding link capacity constraints. Finally, two numerical examples are used to illustrate the proposed model and solution method.     

Quasi-dynamic traffic assignment with residual point queues incorporating a first order node model

Static traffic assignment models are still widely applied for strategic transport planning purposes in spite of the fact that such models produce implausible traffic flows that exceed link capacities and predict incorrect congestion locations. There have been numerous attempts to constrain link flows to capacity. Capacity constrained models with residual queues are often referred to as quasi-dynamic traffic assignment models. After reviewing the literature, we come to the conclusion that an important piece of the puzzle has been missing so far, namely the inclusion of a first order node model. In this paper we propose a novel path-based static traffic assignment model for finding a stochastic user equilibrium in general transportation networks. This model includes a first order (steady-state) node model that yields more realistic turn capacities, which are then used to determine consistent capacity constrained traffic flows, residual point (vertical) queues (upstream bottleneck links), and path travel times consistent with queuing theory. The route choice part of the model is specified as a variational inequality problem, while the network loading part is formulated as a fixed point problem. Both problems are solved using existing techniques to find a solution. We illustrate the model using hypothetical examples, and also demonstrate feasibility on large-scale networks.     

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

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

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.     

On a link-based day-to-day traffic assignment model

In this paper, we perform a rigorous analysis on a link-based day-to-day traffic assignment model recently proposed in He et al. (2010). Several properties, including the invariance set and the constrained stability, of this dynamical process are established. An extension of the model to the asymmetric case is investigated and the stability result is also established under slightly more restrictive assumptions. Numerical experiments are conducted to demonstrate the findings.     

Decision-making on Large Infrastructure Projects: The Role of the Dutch Parliament

Abstract

Validating microscopic traffic simulation models incorporates several challenges because of the inadequacy and rareness of validation data, and the complexity of the car following and lane-changing processes. In addition, validation data were usually measured in aggregate form at the link level and not at the level of the individual vehicle. The majority of model validation attempts in the literature use average link measurements of traffic characteristics. However, validation techniques based on averages of traffic variables have several limitations including possible inconsistency between the field observed and simulation-estimated variables, and as such the resulting spatial–temporal traffic stream patterns.

Due to these inconsistencies, this paper introduces a novel approach to the validation of microscopic traffic simulation models. A three-stage procedure for validating microscopic simulation models is presented. The paper describes the field measurements, experimental setup, and the simulation-based analysis of the three stages. The purpose of the first stage is to validate a benchmark simulator (NETSIM) using limited field data. The second stage examines the spatial–temporal traffic patterns extracted from the benchmark simulator versus those extracted from the simulation model to be validated (I-SIM-S). Different traffic patterns were examined accounting for various factors, such as traffic flow, link speeds, and signal timing. The third stage compares the aggregate traffic measures extracted from the subject simulator against those extracted from the benchmark simulator.     

A path-based flow formulation for the traffic assignment problem

In order to improve cooperation between traffic management and travelers, traffic assignment is the key component to achieve the objectives of both traffic management and route choice decisions for travelers. Traffic assignment can be classified into two models based on the behavioral assumptions governing route choices: User Equilibrium (UE) and System Optimum (SO) traffic assignment. According to UE and SO traffic assignment, travelers usually compete to choose the least cost routes to minimize their own travel costs, while SO traffic assignment requires travelers to work cooperatively to minimize overall cost in the road network. Thus, the paradox of benefits between UE and SO indicates that both are not practical. Thus, a solution technique needs to be proposed to balance UE and SO models, which can compromise both sides and give more feasible traffic assignments. In this paper, Stackelberg game theory is introduced to the traffic assignment problem, which can achieve the trade-off process between traffic management and travelers. Since traditional traffic assignments have low convergence rates, the gradient projection algorithm is proposed to improve efficiency.     

Demand-driven timetable design for metro services

Timetable design is crucial to the metro service reliability. A straightforward and commonly adopted strategy in daily operation is a peak/off-peak-based schedule. However, such a strategy may fail to meet dynamic temporal passenger demand, resulting in long passenger waiting time at platforms and over-crowding in trains. Thanks to the emergence of smart card-based automated fare collection systems, we can now better quantify spatial–temporal demand on a microscopic level. In this paper, we formulate three optimization models to design demand-sensitive timetables by demonstrating train operation using equivalent time (interval). The first model aims at making the timetable more dynamic; the second model is an extension allowing for capacity constraints. The third model aims at designing a capacitated demand-sensitive peak/off-peak timetable. We assessed the performance of these three models and conducted sensitivity analyzes on different parameters on a metro line in Singapore, finding that dynamical timetable built with capacity constraints is most advantageous. Finally, we conclude our study and discuss the implications of the three models: the capacitated model provides a timetable which shows best performance under fixed capacity constraints, while the uncapacitated model may offer optimal temporal train configuration. Although we imposed capacity constraints when designing the optimal peak/off-peak timetable, its performance is not as good as models with dynamical headways. However, it shows advantages such as being easier to operate and more understandable to the passengers.     

Recognition and tracking of spatial–temporal congested traffic patterns on freeways

The two models FOTO (Forecasting of Traffic Objects) and ASDA (Automatische Staudynamikanalyse: Automatic Tracking of Moving Traffic Jams) for the automatic recognition and tracking of congested spatial–temporal traffic flow patterns on freeways are presented. The models are based on a spatial–temporal traffic phase classification made in the three-phase traffic theory by Kerner. In this traffic theory, in congested traffic two different phases are distinguished: “wide moving jam” and “synchronized flow”. The model FOTO is devoted to the identification of traffic phases and to the tracking of synchronized flow. The model ASDA is devoted to the tracking of the propagation of moving jams. The general approach and the different extensions of the models FOTO and ASDA are explained in detail. It is stressed that the models FOTO and ASDA perform without any validation of model parameters in different environmental and traffic conditions. Results of the online application of the models FOTO and ASDA at the TCC (Traffic Control Center) of Hessen near Frankfurt (Germany) are presented and evaluated.     

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

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

Tollroads are only part of the overall trip: the error of our ways in past willingness to pay studies

With rare exception, actual tollroad traffic in many countries has failed to reproduce forecast traffic levels, regardless of whether the assessment is made after an initial year of operation or as long as 10 years after opening. Pundits have offered many reasons for this divergence, including optimism bias, strategic misrepresentation, the promise to equity investors of early returns on investment, errors in land use forecasts, and specific assumptions underlying the traffic assignment models used to develop traffic forecasts. One such assumption is the selection of a behaviourally meaningful value of travel time savings (VTTS) for use in a generalised cost or generalised time user benefit expression that is the main behavioural feature of the traffic assignment (route choice) model. Numerous empirical studies using stated choice experiments have designed choice sets of alternatives as if users choose a tolled route or a free route under the (implied) assumption that the tolled route is tolled for the entire trip. Reality is often very different, with a high incidence of use of a non-tolled road leading into and connecting out of a tolled link. In this paper we recognise this feature of route choice and redesign the stated choice experiment to account for it. Furthermore, this study is a follow up to a previous study undertaken before a new toll road was in place, and it benefits from real exposure to the new toll road. We find that the VTTS is noticeably reduced, and if the VTTS is a significant contributing influence on errors on traffic forecasts, then the lower estimates make sense behaviourally.     

A framework for the assessment of collaborative en route resource allocation strategies

Airspace Flow Programs (AFPs) assign ground delays to flights in order to limit flow through capacity constrained airspace regions. AFPs have been successful in controlling traffic with reasonable delays, but a new program called the Combined Trajectory Options Program, or CTOP, is being explored to further accommodate projected increases in traffic demand. In CTOP, centrally managed rerouting and user preference inputs are also incorporated into initial en route resource allocations. We investigate four alternative versions of resource allocation within CTOP in this research, under differing assumptions about the degree of random variability in airline flight assignment costs when measured against a simple model based upon the flight specific, but otherwise fixed, ratio of airborne flight time and ground delay unit cost. Two en route resource allocation schemes are based on ordered assignments that are similar to those used currently, and the other two are system-optimal assignment schemes. One of these system-optimal schemes is based on complete preference information, which is ideal but not realistic, and the other is based on partial information that may be feasible to implement but yields less efficient assignments. The main contribution of this research is a methodological framework to evaluate and compare these alternative en route resource allocation schemes, under varying assumptions about the information traffic managers have been provided about the flight operators’ route preferences. The framework allows us to evaluate these various schemes under differing assumptions about how well the traffic managers’ flight cost model captures flight costs. A numerical example demonstrates that a sequential resource allocation scheme – where flights are assigned resources in the order in which preference information is submitted – can be more efficient than a scheme that offers a cost minimizing allocation based on less complete preference information, and may at the same time be perceived as equitable. We also find that assigning resources in the order flights are scheduled results in less efficient allocations, but more equitable ones.     

Transit Users’ Route‐Choice Modelling in Transit Assignment: A Review

Abstract

This paper reviews the main studies on transit users’ route choice in the context of transit assignment. The studies are categorized into three groups: static transit assignment, within‐day dynamic transit assignment, and emerging approaches. The motivations and behavioural assumptions of these approaches are re‐examined. The first group includes shortest‐path heuristics in all‐or‐nothing assignment, random utility maximization route‐choice models in stochastic assignment, and user equilibrium based assignment. The second group covers within‐day dynamics in transit users’ route choice, transit network formulations, and dynamic transit assignment. The third group introduces the emerging studies on behavioural complexities, day‐to‐day dynamics, and real‐time dynamics in transit users’ route choice. Future research directions are also discussed.     

The estimation of a time-dependent OD trip table with vehicle trajectory samples

Abstract

In this paper we discuss a dynamic origin–destination (OD) estimation problem that has been used for identifying time-dependent travel demand on a road network. Even though a dynamic OD table is an indispensable data input for executing a dynamic traffic assignment, it is difficult to construct using the conventional OD construction method such as the four-step model. For this reason, a direct estimation method based on field traffic data such as link traffic counts has been used. However, the method does not account for a logical relationship between a travel demand pattern and socioeconomic attributes. In addition, the OD estimation method cannot guarantee the reliability of estimated results since the OD estimation problem has a property named the ‘underdetermined problem.’ In order to overcome such a problem, the method developed in this paper makes use of vehicle trajectory samples with link traffic counts. The new method is applied to numerical examples and shows promising capability for identifying a temporal and spatial travel demand pattern.     

Air traffic assignment to reduce population noise exposure using activity-based approach

Aircraft noise has been regarded as one of the major environmental issues related to air transport. Many airports have introduced a variety of measures to reduce its impact. Several air traffic assignment strategies have been proposed in order to allocate noise more wisely. Even though each decision regarding the assignment of aircraft to routes should consider population exposure to noise, none of the air traffic assignment strategies has addressed daily migrations of population and number of people exposed to noise. The aim of this research is to develop a mathematical model and a heuristic algorithm that could assign aircraft to departure and arrival routes so that number of people exposed to noise is as low as possible, taking into account temporal and spatial variations in population in an airport’s vicinity. The approach was demonstrated on Belgrade airport to show the benefits of the proposed model. Numerical example showed that population exposure to noise could be reduced significantly by applying the proposed air traffic assignment model. As a consequence of the proposed air traffic assignment, overall fuel consumption increased by less than 1%.     

Effects of queue spillover in networks considering simultaneous departure time and route choices

This paper explores the effects of queue spillover in transportation networks, in the context of dynamic traffic assignment. A model of spatial queue is defined to characterize dynamic traffic flow and queuing formation in network links. Network users simultaneously choose departure time and travel route to minimize the travel cost including journey time and unpunctuality penalty. Using some necessary conditions of the dynamic user equilibrium, dynamic network flows are obtained exactly on some networks with typical structure. Various effects of queue spillover are discussed based on the results of these networks, and some new paradoxes of link capacity expansion have been found as a result of such effects. Analytical and exact results in these typical networks show that ignoring queuing length may generate biased solutions, and the link storage capacity is a very important factor concerning the performance of networks.     

Improving the resolution of gridded-hourly mobile emissions: incorporating spatial variability and handling missing data

To more accurately predict hourly running stabilized link volumes for emissions modeling, a new method was recently developed that disaggregates the period-based model link volumes into hourly volumes using observed traffic count data and multivariate multiple regression (MMR). This paper extends the MMR methodology with clustering and classification analyses to account for spatial variability and to accommodate model links that do not have matching observed traffic count data. The methodology was applied to data collected in the South Air Basin. The spatial analysis resulted in identifying five clusters (or 24-h profiles) for San Diego and two clusters for Los Angeles. The MMR models were then estimated with and without clustering. For San Diego, the disaggregated model volumes with clustering were much closer to the observed volumes than those without clustering, with the exception of the a.m. period. For most hours in Los Angeles, the predicted volumes with clustering were only slightly closer to the observed volumes than those predicted without clustering, suggesting that spatial effects are minimal in Los Angeles (i.e., that 24-h volume profiles are fairly similar throughout the region) and clustering is not necessary. Finally, two classification models, one for San Diego and one for Los Angeles were developed and tested for network link data that does not have matching observed count data. The results indicate the procedure is relatively good at predicting a cluster assignment for the unmatched location for Los Angeles but less accurate for San Diego.     

A review on travel behaviour modelling in dynamic traffic simulation models for evacuations

Dynamic traffic simulation models are frequently used to support decisions when planning an evacuation. This contribution reviews the different (mathematical) model formulations underlying these traffic simulation models used in evacuation studies and the behavioural assumptions that are made. The appropriateness of these behavioural assumptions is elaborated on in light of the current consensus on evacuation travel behaviour, based on the view from the social sciences as well as empirical studies on evacuation behaviour. The focus lies on how travellers’ decisions are predicted through simulation regarding the choice to evacuate, departure time choice, destination choice, and route choice. For the evacuation participation and departure time choice we argue in favour of the simultaneous approach to dynamic evacuation demand prediction using the repeated binary logit model. For the destination choice we show how further research is needed to generalize the current preliminary findings on the location-type specific destination choice models. For the evacuation route choice we argue in favour of hybrid route choice models that enable both following instructed routes and en-route switches. Within each of these discussions, we point at current limitations and make corresponding suggestions on promising future research directions.     

A hybrid deep learning based traffic flow prediction method and its understanding

Deep neural networks (DNNs) have recently demonstrated the capability to predict traffic flow with big data. While existing DNN models can provide better performance than shallow models, it is still an open issue of making full use of spatial-temporal characteristics of the traffic flow to improve their performance. In addition, our understanding of them on traffic data remains limited. This paper proposes a DNN based traffic flow prediction model (DNN-BTF) to improve the prediction accuracy. The DNN-BTF model makes full use of weekly/daily periodicity and spatial-temporal characteristics of traffic flow. Inspired by recent work in machine learning, an attention based model was introduced that automatically learns to determine the importance of past traffic flow. The convolutional neural network was also used to mine the spatial features and the recurrent neural network to mine the temporal features of traffic flow. We also showed through visualization how DNN-BTF model understands traffic flow data and presents a challenge to conventional thinking about neural networks in the transportation field that neural networks is purely a “black-box” model. Data from open-access database PeMS was used to validate the proposed DNN-BTF model on a long-term horizon prediction task. Experimental results demonstrated that our method outperforms the state-of-the-art approaches.     

Maximum car ownership under constraints of road capacity and parking space

This paper presents a model for determining the maximum number of cars by zones in view of the capacity of the road network and the number of parking spaces available. In other words, the proposed model is to examine whether existing road network and parking supply is capable of accommodating future zonal car ownership growth (or the reserve capacity in each zone); i.e. the potential maximum zonal car ownership growth that generates the road traffic within the network capacity and parking space constraints. In the proposed model, the vehicular trip production and attraction are dependent on the car ownership, available parking spaces and the accessibility measures by traffic zones. The model is formulated as a bi-level programming problem. The lower-level problem is an equilibrium trip distribution/assignment problem, while the upper-level problem is to maximize the sum of zonal car ownership by considering travellers’ route and destination choice behaviour and satisfying the network capacity and parking space constraints. A sensitivity analysis based heuristic algorithm is developed to solve the proposed bi-level car ownership problem and is illustrated with a numerical example.