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.
Primal–Dual Heuristic for Path Flow Estimation in Medium to Large Networks
Transportation Research Record
Transportation Research Record: Journal of the Transportation Research Board ; 2333 , 1 ; 91-99
2013-01-01
Aufsatz (Zeitschrift)
Elektronische Ressource
Englisch
Primal-Dual Heuristic for Path Flow Estimation in Medium to Large Networks
Online Contents | 2013
|A Network-Based Primal-Dual Heuristic for the Solution of Multicommodity Network Flow Problems
Online Contents | 1993
|A primal-dual traffic assignment algorithm
Tema Archiv | 1975
|British Library Online Contents | 2017
|Primal Method for Determining the Most Likely Route Flows in Large Road Networks
Online Contents | 2006
|