Abstract This paper presents a solution technique for large scale road network equilibrium assignment and related flow problems with nonlinear costs. It is shown that this nonlinear network problem can be solved without explicitly considering any of the constraints—they are satisfied automatically in the procedure developed—and without storing all of the individual decision variables. The computational requirements of the algorithm reported are almost identical to the requirements of heuristic solution techniques for traffic assignment. A solution time of nine seconds on the CDC 6400 was obtained for the test problem, which included 76 arcs and 24 nodes, all of which were origins and destinations.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    An efficient approach to solving the road network equilibrium traffic assignment problem


    Contributors:

    Publication date :

    1975-02-01


    Size :

    10 pages




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English




    Solving the Multiclass Percentile User Equilibrium Traffic Assignment Problem

    Wu, Xing / Nie, Yu (Marco) | Transportation Research Record | 2013



    Traffic assignment to road network

    Almond, J. | Engineering Index Backfile | 1965


    Network Partitioning Algorithms for Solving the Traffic Assignment Problem using a Decomposition Approach

    Yahia, Cesar N. / Pandey, Venktesh / Boyles, Stephen D. | Transportation Research Record | 2018