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.


    Access

    Download

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Primal–Dual Heuristic for Path Flow Estimation in Medium to Large Networks


    Additional title:

    Transportation Research Record: Journal of the Transportation Research Board


    Contributors:


    Publication date :

    2013-01-01




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English