TITLE

# Fixed Point Approaches to the Estimation of O/D Matrices Using Traffic Counts on Congested Networks

AUTHOR(S)
PUB. DATE
May 2001
SOURCE
Transportation Science;May2001, Vol. 35 Issue 2, p1
SOURCE TYPE
DOC. TYPE
Article
ABSTRACT
Over recent years, increasing attention has been devoted to the problem of estimating Origin/Destination (O/D) matrices by using traffic counts, named in the following O/D Count Based Estimation (ODCBE) problem. These methods combine traffic flow measures with other available information to "correct" and improve an initial estimate of the O/D trip matrix. Virtually all models and procedures proposed in the literature are formulated as mathematical programming problems. Most ODCBE models use a relationship relating traffic counts to the unknown O/D matrix; this relationship is often in the form of an explicit estimate of the assignment matrix, i.e., of the fractions of O/D flows using each link of the network for which traffic counts are available. The computation of the assignment matrix is not trivial for congested networks, where travel costs and path choice fractions depend on flows. This problem has been dealt with in relatively few papers in the literature, usually formulated as a bilevel optimisation model under the assumption of a Deterministic User Equilibrium (DUE) assignment model. In this paper, the general within-day static ODCBE problem for congested networks is formulated as a fixed-point problem of an implicit function which results from the solution of a mathematical programming problem. In other words, the solution of the ODCBE problem is an O/D matrix that, once assigned to the network, reproduces flows and costs consistent with the values used to compute the assignment matrix. Fixed-point theorems and algorithms have been extended to the problem at hand. Different fixed-point algorithms, namely, Functional Iteration, Method of Successive Averages, and Method of Successive Averages with Decreasing Reinitialisation are proposed, and their performances are compared on a small test network. It has been verified that all algorithms converge to the same solution, though with different speeds. Furthermore, the fixed-point solution outperforms the...
ACCESSION #
5649387

## Related Articles

• The Estimation of an Origin-Destination Matrix form Traffic Counts. Bell, M. G. H. // Transportation Science;May83, Vol. 17 Issue 2, p198

In this paper, a model is described that will under certain circumstances yield the most likely origin-destination matrix which is consistent with measurements of link traffic volumes. Given knowledge of the proportionate usage of each link by the traffic between each zone pair, the model...

• A Circuit Simulation Technique for Congested Network Traffic Assignment Problem. Hsun-Jung Cho; Heng Huang // AIP Conference Proceedings;12/26/2007, Vol. 963 Issue 2, p993

The relation between electrical circuit and traffic network has been proposed by Sasaki and Inouye, but they proposed link cost function is a linear function which cannot present the congestion situation. Cho and Huang extended the link cost function to a nonlinear function which can explain the...

• A heuristic decomposition method for large-scale traffic assignment: Aburra Valley case study. Lotero, Laura; Jaramillo, Patricia; Rave, Claudia Cristina // Revista Facultad de Ingenieria Universidad de Antioquia;sep2013, Issue 68, p187

Traffic assignment is one of the most important stages in transportation planning; however, its application to real case studies in medium- to largesized cities makes the solution of the model difficult because of the scale and high computational complexity related to the combinatorial and...

• Simultaneous Estimation of the Origin-Destination Matrices and Travel-Cost Coefficient for Congested Networks in a Stochastic User Equilibrium. Hal Yang; Qiang Meng; Bell, Michael G. H. // Transportation Science;May2001, Vol. 35 Issue 2, p1

This article proposes an optimization model for simultaneous estimation of an origin-destination (O-D) matrix and a travel-cost coefficient for congested networks in a logit-based stochastic user equilibrium (SUE). The model is formulated in the form of a standard differentiable, nonlinear...

• Dynamic traffic assignment: Considerations on some deterministic modelling approaches. Codina, E.; Barcel�, J. // Annals of Operations Research;1995, Vol. 60 Issue 1-4, p1

Research on how to model the dynamic behaviour of traffic flows efficiently and the development of algorithms to handle such models numerically has become a key activity in recent years as a consequence of the emerging applications of advanced technologies to transport. This paper offers a...

• Locating flow-intercepting facilities: New approaches and results. Berman, Oded; Krass, Dmitry; Chen Wei Xu // Annals of Operations Research;1995, Vol. 60 Issue 1-4, p121

The problem of locating flow-intercepting facilities on a network with probabilistic customer flows and with facility set-up costs is studied in this paper. Two types of models are investigated, namely the double-counting model and the no-double-counting model (double-counting refers to multiple...

• Estimation of Origin-Destination Demand Matrix for the Urban Multimodal Traffic Network. Yanan WANG; Bingfeng SI // Applied Mechanics & Materials;2014, Issue 511-512, p963

In this paper we consider a procedure for the estimation of origin-destination (O-D) matrices for a multimodal transit network. The structure of urban multimodal transport system is fully analyzed and then a bi-level programming model is established for O-D demand matrices estimation, where the...

• Estimation and Prediction of Time-Dependent Origin-Destination Flows with a Stochastic Mapping to Path Flows and Link Flows. Ashok, K.; Ben-Akiva, M. E. // Transportation Science;May2002, Vol. 36 Issue 2, p184

This paper presents a new suite of models for the estimation and prediction of time-dependent Origin-Destination (O-D) matrices. The key contribution of the proposed approach is the explicit modeling and estimation of the dynamic mapping (the assignment matrix) between time-dependent O-D flows...

• System optimal and user equilibrium time-dependent traffic assignment in congested networks. Peeta, Srinivas; Mahmassani, Hani S. // Annals of Operations Research;1995, Vol. 60 Issue 1-4, p81

This paper formulates two dynamic network traffic assignment models in which O-D desires for the planning horizon are assumed known a priori: the system optimal (SO) and the user equilibrium (UE) time-dependent traffic assignment formulations. Solution algorithms developed and implemented for...

Share