Abstract This paper presents a convergent simplicial decomposition algorithm for the variational inequality formulation of the asymmetric traffic assignment problem. It alternates between generating minimum path trees based on the cost function evaluated at the current iterate and the approximate solving of a master variational inequality subject to simple convexity constraints. Thus it generalizes the popular Frank-Wolfe method (where the master problem is a line search) to the asymmetric problem. Rules are given for dropping flow patterns which are not needed to express the current iterate as a convex combination of previous patterns. The results of some computational testing are reported.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    Simplical decomposition of the asymmetric traffic assignment problem


    Beteiligte:

    Erschienen in:

    Erscheinungsdatum :

    19.08.1983


    Format / Umfang :

    11 pages




    Medientyp :

    Aufsatz (Zeitschrift)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch



    Simplical pivoting for mesh generation of implicity defined surfaces

    Allgower,E.L. / Gnutzmann,S. / Daimler-Benz,Berlin,DE et al. | Kraftfahrwesen | 1991


    Convex programming formulations of the asymmetric traffic assignment problem

    Hearn, Donald W. / Lawphongpanich, Siriphong / Nguyen, Sang | Elsevier | 1983


    A simplicial decomposition algorithm to solve the traffic assignment problem

    Lee, S. / Universities Transport Study Group | British Library Conference Proceedings | 1992


    Asymmetric Multiclass Traffic Assignment: A Coherent Formulation

    Toint, P. / Wynter, L. | British Library Conference Proceedings | 1996