Abstract
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.
Get full access to this article
View all access options for this article.
