Abstract This paper examines a model due to Nguyen for estimating origin-destination (O-D) matrices from observed traffic flows on each network link. It is shown that the previous bilevel optimization models for choosing an O-D matrix can be transformed into single convex programs. Under the condition that the observed link flow pattern is an equilibrium, Nguyen's model is demonstrated to be equivalent to an underspecified system of linear equations with non-negative variables. By exploiting the properties of the system's feasible region, simpler methods, such as a least squares technique, can be used to obtain an O-D matrix that, when user-optimally assigned to the network, reproduces the observed link flows.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    The equilibrium-based origin-destination matrix estimation problem


    Beteiligte:
    Yang, Hai (Autor:in) / Iida, Yasunori (Autor:in) / Sasaki, Tsuna (Autor:in)

    Erschienen in:

    Erscheinungsdatum :

    1992-10-06


    Format / Umfang :

    11 pages




    Medientyp :

    Aufsatz (Zeitschrift)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch




    The Elevator Trip Origin-Destination Matrix Estimation Problem

    Kuusinen, Juha-Matti | Online Contents | 2014


    The Elevator Trip Origin-Destination Matrix Estimation Problem

    Kuusinen, Juha-Matti / Sorsa, Janne / Siikonen, Maria-Liisa | British Library Online Contents | 2015