Abstract In this chapter is devoted to approaches for solving traffic flow assignment problems. The most popular gradient descent method for solving traffic assignment problems is discussed in the first section. New projection algorithms based on the obtained, explicitly fixed-point operators for the route-flow assignment problem and link-route assignment problem are presented in the third and fourth sections respectively. Obtained operators is proved to be contractive that leads to the linear convergence of provided algorithms. Moreover, under some fairly natural conditions the algorithms converge quadratically. The technique for representing a linear route-flow assignment problem in the form of a system of linear equations is presented in the fourth section. A simple example demonstrates the evident usability of the developed technique for its implementation and further extensions.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Methods for Traffic Flow Assignment in Road Networks


    Contributors:


    Publication date :

    2019-11-27


    Size :

    28 pages





    Type of media :

    Article/Chapter (Book)


    Type of material :

    Electronic Resource


    Language :

    English




    Competitive Traffic Assignment in Road Networks

    Krylatov Alexander Y. / Zakharov Victor V. / Malygin Igor G. | DOAJ | 2016

    Free access

    Dynamic traffic assignment for urban road networks

    Janson, Bruce N. | Elsevier | 1989


    Road traffic assignment — a review

    Matsoukis, E. C. | Taylor & Francis Verlag | 1986


    Traffic assignment to road network

    Almond, J. | Engineering Index Backfile | 1965


    Road traffic assignment—a review

    Matsoukis, E. C. / Michalopoulos, P. C. | Taylor & Francis Verlag | 1986