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.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Simplical decomposition of the asymmetric traffic assignment problem


    Contributors:

    Published in:

    Publication date :

    1983-08-19


    Size :

    11 pages




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English



    Simplical pivoting for mesh generation of implicity defined surfaces

    Allgower,E.L. / Gnutzmann,S. / Daimler-Benz,Berlin,DE et al. | Automotive engineering | 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


    An equivalent optimization formulation for the traffic assignment problem with asymmetric linear costs

    Grange, Louis de / Muñoz, Juan Carlos | Taylor & Francis Verlag | 2009