Abstract We provide a sufficient condition for the convergence of diagonalization algorithms for equilibrium traffic assignment problems with asymmetric Jacobian matrix B(v) of the link user cost mapping s(v) of the flow v. When |I−D(v) 1 2 B(v) D(v 1 2 | 2 < 1, where D(v) > 0 is the diagonal of B(v ) and v is the equilibrium flow, we demonstrate a local convergence theorem for nonlinear cost functions. The implication of this result for practical applications of the model are outlined.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    The convergence of diagonalization algorithms for asymmetric network equilibrium problems


    Contributors:

    Published in:

    Publication date :

    1981-12-18


    Size :

    7 pages




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English