Estimation of origin-destination matrices from link traffic counts on congested networks

Conventional methods for estimating origin-destination (O-D) trip matrices from link traffic counts assume that route choice proportions are given constants. In a network with realistic congestion levels, this assumption does not hold. This paper shows how existing methods such as the generalized least squares technique can be integrated with an equilibrium traffic assignment in the form of a convex bilevel optimization problem. The presence of measurement errors and time variations in the observed link flows are explicitly considered. The feasibility of the model is always guaranteed without a requirement for estimating consistent link flows from counts. A solution algorithm is provided and numerical simulation experiments are implemented in investigating the model's properties. Some related problems concerning O-D matrix estimation are also discussed.     

Traffic assignment by trip type using volume restraint and link restraint for application in small urban areas

This research involved the development of a new traffic assignment model consisting of a set of procedures for an urbanized area with a population of 172,000. Historical, social, and economic data were used as input to conventional trip generation and trip distribution models to produce a trip table for network assignment. This fixed table was divided into three trip types: external-external trips, external-internal trips, and internal-internal trips. The methodology used to develop the new traffic assignment model assigned each of the trip types by varying the diversion of trips from the minimum path. External-external trips were assigned on a minimum path routing and external-internal trips were assigned with a slight diversion from the minimum path. Internal-internal trips were assigned with more diversion than external-internal trips and adjusted by utilizing iterative volume restraint and incremental link restraint. A statistical analysis indicated that assigning trips by trip types using trip diversion and volume and link restraint produces a significant improvement in the accuracy of the assigned traffic volumes.     

An empirical study of simulation-based dynamic traffic assignment procedures

Abstract

Under Intelligent Transportation Systems (ITS), real-time operations of traffic management measures depend on long-term planning results, such as the origin–destination (OD) trip distribution; however, results from current planning procedures are unable to provide fundamental data for dynamic analysis. In order to capture dynamic traffic characteristics, transportation planning models should play an important role to integrate basic data with real-time traffic management and control. In this paper, a heuristic algorithm is proposed to establish the linkage between daily OD trips and dynamic traffic assignment (DTA) procedures; thus results from transportation planning projects, in terms of daily OD trips, can be extended to estimate time-dependent OD trips. Field data from Taiwan are collected and applied in the calibration and validation processes. Dynamic Network Assignment-Simulation Model for Advanced Road Telematics (DYNASMART-P), a simulation-based DTA model, is applied to generate time-dependent flows. The results from the validation process show high agreement between actual flows from vehicle detectors (VDs) and simulated flows from DYNAMSART-P.     

Computational experience with an application of a simultaneous transportation equilibrium model to urban travel in Austin,Texas

Safwat and Magnanti (1988) have developed a combined trip generation, trip distribution, modal split, and traffic assignment model that can predict demand and performance levels on large-scale transportation networks simultaneously, i.e. a simultaneous transportation equilibrium model (STEM). The major objective of this paper is to assess the computational efficiency of the STEM approach when applied to an urban large-scale network, namely the urban transportation system of Austin, Texas. The Austin network consisted of 520 zones, 19,214 origin-destination (O-D) pairs, 7,096 links and 2,137 nodes. The Central Processing Unit (CPU) time on an IBM 4381 mainframe computer was 430 seconds for a typical iteration and about 4,734 seconds, less than 79 minutes, to arrive at a reasonably accurate solution in no more than 10 iterations. The computational time at any given iteration is comparable to that of the standard fixed demand traffic assignment procedure. These results encourage further applications of the STEM model to large urban areas.     

A comparison of stochastic and deterministic traffic assignment over congested networks

The similarity between link flows obtained from deterministic and stochastic equilibrium traffic assignment models is investigated at different levels of congestion. A probit-based stochastic assignment is used (over a congested network) where the conditions for equilibrium are those given by Daganzo and Sheffi (1977). Stochastic equilibrium flows are generated using an iterative procedure with predetermined step sizes, and the resulting assignment is validated on the basis of the equilibrium criteria. The procedure is intended to assist in the choice of the most appropriate assignment algorithm for a given level of congestion.     

Direct formulation and algorithms for the probit-based stochastic user equilibrium traffic assignment problem

This paper proposes simple and direct formulation and algorithms for the probit-based stochastic user equilibrium traffic assignment problem. It is only necessary to account for random variables independent of link flows by performing a simple transformation of the perceived link travel time with a normal distribution. At every iteration of a Monte-Carlo simulation procedure, the values of the random variables are sampled based on their probability distributions, and then a regular deterministic user equilibrium assignment is carried out to produce link flows. The link flows produced at each iteration of the Monte-Carlo simulation are averaged to yield the final flow pattern. Two test networks demonstrate that the proposed algorithms and the traditional algorithm (the Method of Successive Averages) produce similar results and that the proposed algorithms can be extended to the computation of the case in which the random error term depends on measured travel time.     

Comparison of results of two models of transportation demand in Hong Kong: CDAM and a version of microTRIPS

CDAM is a new computer program for solving the combined trip distribution and assignment model for multiple user classes, which enables transport planners to estimate consistent Origin-Destination (O-D) matrices and equilibrium traffic flows simultaneously if the trip production and attraction of each user class at zone centroids are available. This paper reports an application of CDAM to the central Kowloon study area in Hong Kong. The coefficients of the model related to the components of generalized costs are calibrated on 1986 travel data. A comparison of results of CDAM and a version of MicroTRIPS models of transportation demand in Hong Kong are presented. Finally, some conclusions are drawn and the advantage of the CDAM are discussed.     

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.     

Simultaneous estimation of an origin–destination matrix and link choice proportions using traffic counts

A procedure for the simultaneous estimation of an origin–destination (OD) matrix and link choice proportions from OD survey data and traffic counts for congested network is proposed in this paper. Recognizing that link choice proportions in a network change with traffic conditions, and that the dispersion parameter of the route choice model should be updated for a current data set, this procedure performs statistical estimation and traffic assignment alternately until convergence in order to obtain the best estimators for both the OD matrix and link choice proportions, which are consistent with the survey data and traffic counts.Results from a numerical study using a hypothetical network have shown that a model allowing θ to be estimated simultaneously with an OD matrix from the observed data performs better than the model with a fixed predetermined θ. The application of the proposed model to the Tuen Mun Corridor network in Hong Kong is also presented in this paper. A reasonable estimate of the dispersion parameter θ for this network is obtained.     

Route swapping in dynamic traffic networks

A dynamic traffic assignment (DTA) model typically consists of a traffic performance model and a route choice model. The traffic performance model describes how traffic propagates (over time) along routes connecting origin-destination (OD) pairs, examples being the cell transmission model, the vertical queueing model and the travel time model. This is implemented in a dynamic network loading (DNL) algorithm, which uses the given route inflows to compute the link inflows (and hence link costs), which are then used to compute the route travel times (and hence route costs). A route swap process specifies the route inflows for tomorrow (at the next iteration) based on the route inflows today (at the current iteration). A dynamic user equilibrium (DUE), where each traveller on the network cannot reduce his or her cost of travel by switching to another route, can be sought by iterating between the DNL algorithm and the route swap process. The route swap process itself takes up very little computational time (although route set generation can be very computationally intensive for large networks). However, the choice of route swap process dramatically affects convergence and the speed of convergence. The paper details several route swap processes and considers whether they lead to a convergent system, assuming that the route cost vector is a monotone function of the route inflow vector.     

Tests of assignment accuracy: An interurban case study

This paper is concerned with methods of testing the accuracy of traffic assignments. It focuses on the fact that whereas assignment models are usually based on a behavioural hypothesis about drivers' route choice (e.g. cost or time minimisation) the test of the accuracy of the assignment is the extent to which observed link loadings are reproduced. This inconsistency opens up the doubt that an apparently “accurate” assignment on this basis may be a result of compensating errors. It is difficult to apply the same test to accuracy of route choices as is applied to accuracy of link loadings (e.g. chi square, correlation coefficient) and hence a new measure is devised here which can be applied both to comparisons between observed and predicted route choices and comparisons between observed and predicted loadings. It is, moreover, possible to devise a test of significance for this measure so that one can test whether a predicted assignment is significantly different from what one, might have observed on the basis of chance observation. A case study is carried out to test the proposed method. Traffic flows between 72 origins and destinations on either side of the Pennine Mountains in Britain are assigned to a network using different assignment techniques with varied parameters. In all, one hundred and ninety assignments are carried out and the degree of correspondence between observed and predicted route choices and link loadings is measured. The results tend to confirm that the link loadings criterion is not a very stable criterion and that the route choice correspondence criteria seems to behave in a sensible way. A simulation exercise is carried out which produces the probability distribution of the “route-fit” index for different assumed sample levels. The paper concludes by suggesting avenues for further research.     

Validating the Passenger Traffic Model for Copenhagen

The paper presents a comprehensive validation procedure for the passenger traffic model for Copenhagen based on external data from the Danish national travel survey and traffic counts. The model was validated for the years 2000–2004, with 2004 being of particular interest because the Copenhagen Metro became operational in autumn 2002. We observed that forecasts from the demand sub-models agree well with the data from the 2000 national travel survey, with the mode choice forecasts in particular being a good match with the observed modal split. The results of the 2000 car assignment model matched the observed traffic better than those of the transit assignment model. With respect to the metro forecasts, the model over-predicts metro passenger flows by 10–50%. The wide range of findings from the project resulted in two actions. First, a project was started in January 2005 to upgrade the model’s base trip matrices. Second, a dialog between researchers and the Ministry of Transport has been initiated to discuss the need to upgrade the Copenhagen model, e.g. a switching to an activity-based paradigm and improving assignment procedures.     

Determining intermediate origin-destination matrices for the analysis of composite mode trips

We consider in this paper the problem of determining intermediate origin-destination matrices for composite mode trips that involve a trip by private car to a parking facility and the continuation of the trip to the destination either by walking or by a transit mode. The intermediate origin-destination matrices relate to each component of the composite mode trip: a matrix from the trip origins to intermediate destinations which are parking lots and a matrix from the parking lots to the final destinations. The approach that we propose to solve this problem is to modify the entropy based trip distribution models to consider inequality constraints related to parking lot capacities. Such models may be easily calibrated by using well known calibration methods or generalization of these methods and may be easily solved by applying a primal feasible direction method of nonlinear programming.     

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.     

Path-constrained traffic assignment: A trip chain analysis under range anxiety

This paper proposes and analyzes a distance-constrained traffic assignment problem with trip chains embedded in equilibrium network flows. The purpose of studying this problem is to develop an appropriate modeling tool for characterizing traffic flow patterns in emerging transportation networks that serve a massive adoption of plug-in electric vehicles. This need arises from the facts that electric vehicles suffer from the “range anxiety” issue caused by the unavailability or insufficiency of public electricity-charging infrastructures and the far-below-expectation battery capacity. It is suggested that if range anxiety makes any impact on travel behaviors, it more likely occurs on the trip chain level rather than the trip level, where a trip chain here is defined as a series of trips between two possible charging opportunities (Tamor et al., 2013). The focus of this paper is thus given to the development of the modeling and solution methods for the proposed traffic assignment problem. In this modeling paradigm, given that trip chains are the basic modeling unit for individual decision making, any traveler’s combined travel route and activity location choices under the distance limit results in a distance-constrained, node-sequenced shortest path problem. A cascading labeling algorithm is developed for this shortest path problem and embedded into a linear approximation framework for equilibrium network solutions. The numerical result derived from an illustrative example clearly shows the mechanism and magnitude of the distance limit and trip chain settings in reshaping network flows from the simple case characterized merely by user equilibrium.     

An investigation of the reliability of real-time information for route choice decisions in a congested traffic system

This paper investigates the reliability of information on prevailing trip times on the links of a network as a basis for route choice decisions by individual drivers. It considers a type of information strategy in which no attempt is made by some central controller or coordinating entity to predict what the travel times on each link would be by the time it is reached by a driver that is presently at a given location. A specially modified model combining traffic simulation and path assignment capabilities is used to analyze the reliability of the real-time information supplied to the drivers. This is accomplished by comparing the supplied travel times (at the link and path levels) to the actual trip times experienced in the network after the information has been given. In addition, the quality of the decisions made by drivers on the basis of this information (under alternative path switching rules) is evaluated ex-post by comparing the actually experienced travel time (given the decision made) to the time that the driver would have experienced without the real-time information. Results of a series of simulation experiments under recurrent congestion conditions are discussed, illustrating the interactions between information reliability and user response.     

Hierarchical travel demand estimation using multiple data sources: A forward and backward propagation algorithmic framework on a layered computational graph

Aiming to develop a theoretically consistent framework to estimate travel demand using multiple data sources, this paper first proposes a multi-layered Hierarchical Flow Network (HFN) representation to structurally model different levels of travel demand variables including trip generation, origin/destination matrices, path/link flows, and individual behavior parameters. Different data channels from household travel surveys, smartphone type devices, global position systems, and sensors can be mapped to different layers of the proposed network structure. We introduce Big data-driven Transportation Computational Graph (BTCG), alternatively Beijing Transportation Computational Graph, as the underlying mathematical modeling tool to perform automatic differentiation on layers of composition functions. A feedforward passing on the HFN sequentially implements 3 steps of the traditional 4-step process: trip generation, spatial distribution estimation, and path flow-based traffic assignment, respectively. BTCG can aggregate different layers of partial first-order gradients and use the back-propagation of “loss errors” to update estimated demand variables. A comparative analysis indicates that the proposed methods can effectively integrate different data sources and offer a consistent representation of demand. The proposed methodology is also evaluated under a demonstration network in a Beijing subnetwork.     

Simplified transport models based on traffic counts

Having accepted the need for the development of simpler and less cumbersome transport demand models, the paper concentrates on one possible line for simplification: estimation of trip matrices from link volume counts. Traffic counts are particularly attractive as a data basis for modelling because of their availability, low cost and nondisruptive character. It is first established that in normal conditions it may be possible to find more than one trip matrix which, when loaded onto a network, reproduces the observed link volumes. The paper then identifies three approaches to reduce this underspecification problem and produce a unique trip matrix consistent with the counts. The first approach consists of assuming that trip-making behaviour can be explained by a gravity model whose parameters can be calibrated from the traffic counts. Several forms of this gravity model have been put forward and they are discussed in Section 3. The second approach uses mathematical programming techniques associated to equilibrium assignment problems to estimate a trip matrix in congested areas. This method can also be supplemented by a special distribution model developed for small areas. The third approach relies on entropy and information theory considerations to estimate the most likely trip matrix consistent with the observed flows. A particular feature of this group is that they can include prior, perhaps outdated, information about the matrix.These three approaches are then compared and their likely areas for application identified. Problems for further research are discussed and finally an assessment is made of the possible role of these models vis-a-vis recent developments in transport planning.     

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.     

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.