Abstract In this note we compare the computational efficiency of projection and relaxation methods for the solution of the asymmetric traffic equilibrium problem with elastic demands with their computational efficiency for the fixed demand problem. In particular, we tested networks with three different classes of travel cost and travel disutility functions. Our experiments suggest that the form of the travel cost and disutility functions affects not only the relative efficiencies of these two methods but also their overall efficiencies.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    Computational comparisons of algorithms for general asymmetric traffic equilibrium problems with fixed and elastic demands


    Beteiligte:
    Nagurney, Anna (Autor:in)

    Erschienen in:

    Erscheinungsdatum :

    15.05.1985


    Format / Umfang :

    7 pages




    Medientyp :

    Aufsatz (Zeitschrift)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch



    Equilibrium assignment algorithms : comparison of some algorithms for equilibrium traffic assignment with fixed demands

    Arezki, Y. / University of Leeds, Institute for Transport Studies | TIBKAT | 1986



    Dynamic Traffic Network Equilibrium System with Elastic Demands

    Shi, Chao-Feng / Wang, Ying-Rui | Tema Archiv | 2014


    Dynamic Traffic Network Equilibrium System with Elastic Demands

    Shi, C.F. / Wang, Y.R. | British Library Conference Proceedings | 2014