Abstract A fundamental property of traffic assignment is that cyclic flows from a common origin or to a common destination cannot exist in an equilibrium solution. However, cyclic flows can easily be created by the Frank-Wolfe (F-W) assignment procedure, especially during its first several iterations. The PARTAN technique—a more rapidly converging derivative of the F-W method—can also create cyclic flows during its procedure. We show in this paper that once cyclic flows become part of a combined assignment, they are difficult to correct, thus presenting one impediment to convergence. We then present modifications to the F-W and PARTAN procedures that prevent cyclic flows from being created between adjacent pairs of nodes. The avoidance of cyclic flows in test problems is shown to accelerate the convergence of both the F-W and PARTAN techniques, particularly in the first several iterations. While the impossibility of cyclic flows in a true equilibrium solution is an important property of traffic assignment, this paper shows that (1) the F-W and PARTAN procedures eventually reduce cyclic flows to zero if they occur, (2) avoiding cyclic flows can be most helpful in the early iterations of these procedures, and (3) avoiding cyclic flows in large networks is very difficult because of large computational requirements.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    The problem of cyclic flows in traffic assignment


    Contributors:

    Published in:

    Publication date :

    1986-06-15


    Size :

    12 pages




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English



    Cyclic flows. Markov process and stochastic traffic assignment

    Akamatsu, Takashi | Online Contents | 1996



    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



    System Optimum Fuzzy Traffic Assignment Problem

    Gizem Temelcan / Hale Gonce Kocken / Inci Albayrak | DOAJ | 2019

    Free access