Abstract This paper examines different formulations for estimating trip matrices on congested networks from link traffic count data. It is shown that several existing approaches can be expected to produce the same results when observed counts constitute a user optimal link flow pattern. This has important practical implications because of the computational difficulties associated with some of the formulations.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Trip matrix estimation from link traffic counts: The congested network case


    Contributors:
    Fisk, C.S. (author)

    Published in:

    Publication date :

    1988-12-02


    Size :

    6 pages




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English



    The most likely trip matrix estimated from traffic counts

    Van Zuylen, Henk J. / Willumsen, Luis G. | Elsevier | 1979



    A note on trip matrix estimation from link traffic count data

    Fisk, C.S. / Boyce, D.E. | Elsevier | 1982


    Algorithms for the Solution of the Congested Trip Matrix Estimation Problem

    Maher, M. / Zhang, X. | British Library Conference Proceedings | 1999