In this paper we consider how to determine route traffic flows for traffic assignment problem (TAP). A new approach is proposed for this purpose. It determines the route traffic flows indirectly. It solves the problem based on the solution of the link based model for the user equilibrium TAP given by LeBlanc but without enumerating all routes of the concerned traffic network explicitly. In this approach a modified Frank-Wolfe algorithm is first applied to obtain link traffic flows with different destinations for TAP, which are then used to determine the route traffic flows by a new algorithm. A simple numerical example is given to illustrate the availability of the new approach. A comparison between the new approach and the other algorithms are made.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Determining route traffic flows for traffic assignment problem with Frank-Wolfe algorithm


    Contributors:
    Feng Li, (author) / Shuning Wang, (author)


    Publication date :

    2005-01-01


    Size :

    937303 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    Determining Route Traffic Flows for Traffic Assignment Problem with Frank-Wolfe Algorithm

    Li, F. / Wang, S. / Institute of Electrical and Electronics Engineers | British Library Conference Proceedings | 2005




    Faster Frank-Wolfe Traffic Assignment with New Flow Update Scheme

    Chen, A. / Jayakrishnan, R. / Tsai, W. K. | British Library Online Contents | 2002


    Accelerating Strategies and Computational Studies of the Frank-Wolfe Algorithm for the Traffic Assignment Problem

    Lee, D.-H. / Nie, Y. / National Research Council | British Library Conference Proceedings | 2001