Abstract We present a nonproportional-assignment, user-equilibrium motivated, linear programming model for estimating origin-destination (O-D) trip tables from available data on link traffic volumes. The model is designed to determine a traffic equilibrium network flow solution that reproduces the link volume data, if such a solution exists. However, it recognizes that due to incomplete information, the traffic may not conform to an equilibrium flow pattern, and moreover, there might be inconsistencies in the observed link flow data. Accordingly, the model permits violations in the equilibrium conditions as well as deviations from the observed link flows but at suitable incurred penalties in the objective function. A column generation solution technique is presented to optimally solve the problem. This methodology is extended to the situation in which a specified prior target trip table is available and one is required to find a solution that also has a tendency to match this table as closely as possible. Implementation strategies are discussed and the proposed method is illustrated using some sample test networks from the literature.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    A linear programming approach for synthesizing origin-destination trip tables from link traffic volumes


    Beteiligte:

    Erschienen in:

    Erscheinungsdatum :

    1993-06-15


    Format / Umfang :

    21 pages




    Medientyp :

    Aufsatz (Zeitschrift)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch