01340139

Component

https://doi.org/10.3141/2263-03

http://scholar.google.com...pere&publication_year=2011

In origin–destination (O-D) estimation methods, the relationship between the link flows and the O-D flows is typically approximated by a linear function described by the assignment matrix that corresponds with the current estimate of the O-D flows. However, this relationship implicitly assumes the link flows to be separable; this assumption leads to biased results in congested networks. The use of a different linear approximation of the relationship between O-D flows and link flows has been suggested to take into account link flows being nonseparable. However, deriving this relationship is cumbersome in terms of computation time. In this paper, the use of marginal computation (MaC) is proposed. MaC is a computationally efficient method that performs a perturbation analysis, with the use of kinematic wave theory principles, to derive this relationship. The use of MaC for dynamic O-D estimation was tested on a study network and on a real network. In both cases the proposed methodology performed better than traditional O-D estimation approaches, and thereby showed its merit.

01365004

11-2443

English

pp 19-25

2011

Transportation Research Record: Journal of the Transportation Research Board

9780309223034

Print

Figures (5) ; References (21) ; Tables (1)

Kinematics; Networks; Origin and destination; Perturbations; Traffic congestion; Traffic estimation; Traffic flow

Computational efficiency; Kinematic wave theory; Link flows

Highways; Planning and Forecasting; I72: Traffic and Transport Planning

TRIS, TRB

Feb 17 2011 6:10PM

• Adaptive Traffic Control for Large-Scale Dynamic Traffic Assignment Applications
• Application of Discrete Fourier Transform to Find Reliable Shortest Paths
• Bi-Level Optimization Model for Public Transportation Network Redesign Problem: Accounting for Equity Issues
• Capacitated-Vehicle Routing Problem with Backhauls on Trees: Model, Properties, Formulation, and Algorithm
• Centralized Time-Dependent Multiple-Carrier Collaboration Problem for Less-Than-Truckload Carriers
• Comparison of Multiobjective Evolutionary Algorithms for Optimization of Externalities by Using Dynamic Traffic Management Measures
• Computing Individual Path Marginal Cost in Networks with Queue Spillbacks
• Day-to-Day Dynamic Model in Discrete–Continuum Transportation Networks
• Disaggregate Multimodal Travel Demand Modeling Based on Road Pricing and Access to Transit
• Distribution and Assignment of Compulsory and Discretionary Traffic
• Efficient Methodology for Benchmarking Dynamic Origin–Destination Demand Estimation Methods
• Many-to-Many Game-Theoretic Approach for the Measurement of Transportation Network Vulnerability
• Methodology for Locating Link Count Sensors That Accounts for Reliability of Prior Estimates from Origin–Destination Matrices
• Model of Traffic Flow Capacity Constraint Through Nodes for Dynamic Network Loading with Queue Spillback
• Select Zone Analysis for Traffic Impact Studies
• Time-Dependent Origin–Destination Demand Estimation: Challenges and Methods for Large-Scale Networks with Multiple Vehicle Classes
• Transit Stop-Level Origin–Destination Estimation Through Use of Transit Schedule and Automated Data Collection System
• Travel Speed Forecasting by Means of Continuous Conditional Random Fields
• Vulnerability Analysis of Transportation Network Under Scenarios of Sea Level Rise