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.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

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


    Beteiligte:
    Fisk, C.S. (Autor:in)

    Erschienen in:

    Erscheinungsdatum :

    1988-12-02


    Format / Umfang :

    6 pages




    Medientyp :

    Aufsatz (Zeitschrift)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch



    The most likely trip matrix estimated from traffic counts

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



    Algorithms for the Solution of the Congested Trip Matrix Estimation Problem

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


    A note on trip matrix estimation from link traffic count data

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