The assignment of traffic flow to minimum cost routes through a road network is complicated by the fact that each road in the network may have a separate relationship between the flow along that road and the average speed at which it will travel. This problem, that of assignment based on such speed flow relationships, is difficult to handle in practice and most methods yield flow assignments of uncertain precision. The report presents a technique for producing assignments over congested routes and for assessing the accuracy of the result. By reiteration solutions of increasing precision can be obtained. At the same time the size of systematic errors is indicated thus enabling confidence limits to be set in economic assessments that are based on the flow assignments. The methodology can be extended to handle overloaded networks, and comparisons are drawn between this approach and the linear programming methods employed in phase 3 of the London Transportation Study. (Author)


    Access

    Access via TIB

    Check availability in my library


    Export, share and cite



    Title :

    A Perturbation Model for Congested and Overloaded Transportation Networks


    Contributors:

    Publication date :

    1971


    Size :

    25 pages


    Type of media :

    Report


    Type of material :

    No indication


    Language :

    English




    A perturbation model for congested and overloaded transportation networks

    Wigan, M. Ramsay / Bamford, T. J. G. | TIBKAT | 1971




    Transportation Processes Modelling in Congested Road Networks

    Krylatov, Alexander / Zakharov, Victor / Tuovinen, Tero | Springer Verlag | 2019


    Soviet's congested transportation system

    Engineering Index Backfile | 1932