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

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

0.00 Avg rating0 Votes
Article ID: iaor1994197
Country: United States
Volume: 26B
Issue: 6
Start Page Number: 417
End Page Number: 434
Publication Date: Dec 1992
Journal: Transportation Research. Part B: Methodological
Authors: , , ,
Keywords: statistics: general
Abstract:

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.

Reviews

Required fields are marked *. Your email address will not be published.