01476751

Component

https://doi.org/10.3141/2333-11

http://scholar.google.com...hang&publication_year=2013

The path flow estimator, an origin–destination demand estimation algorithm that relies on the computation of path flows, can be slow when applied to medium to large networks. A primal–dual heuristic that can significantly improve the computational efficiency of the algorithm when it is applied to large networks is developed. Numerical examples are provided to show the performance improvement of this primal–dual heuristic over the original path flow estimator algorithm.

01490598

13-3451

English

pp 91–99

2013

Transportation Research Record: Journal of the Transportation Research Board

9780309263382

Print

Figures (4) ; References (29) ; Tables (1)

Algorithms; Heuristic methods; Networks; Numerical analysis; Origin and destination

Path flow estimator

Highways; Operations and Traffic Management; Planning and Forecasting; I72: Traffic and Transport Planning; I73: Traffic Control

PRP, TRIS, TRB, ATRI

Feb 5 2013 12:41PM

• Analysis and Design of Tradable Credit Schemes Under Uncertainty
• Bilevel Generalized Least Squares Estimation of Dynamic Origin-Destination Matrix for Urban Network with Probe Vehicle Data
• Delays Caused by Incidents: Data-Driven Approach
• Finding Reliable Shortest Paths in Dynamic Stochastic Networks
• Formulation and Algorithms for Discrete Minimum-Cost Group Assembly Problem
• Limited Information-Sharing Strategy for Taxi-Customer Searching Problem in Nonbooking Taxi Service
• Model-Based Dynamic Pricing Algorithm for Managed Lanes
• Modeling Framework to Analyze Effect of Multiple Traffic Information Service Providers on Traffic Network Performance
• Optimization of Variable Speed Limits for Efficient, Safe, and Sustainable Mobility
• Reliability-Based Modeling of Park-and-Ride Service on Linear Travel Corridor