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.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

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


    Contributors:


    Publication date :

    1985-05-15


    Size :

    7 pages




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English



    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, C.F. / Wang, Y.R. | British Library Conference Proceedings | 2014


    Dynamic Traffic Network Equilibrium System with Elastic Demands

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