Abstract A family of algorithms for assigning trips onto a road network is developed based on “stochastic” models of route choice which explicitly allow non minimum cost routes to be used. Several alternative formulations are identified and compared both from a theoretical point of view and by a series of tests on a representative London network. As a result of these a “best” choice is given. Although the methods described are most appropriate to networks where congestion effects are unimportant their convergence behaviour with congestion included has also been tested; for the particular network and cost-volume relationships considered a satisfactory degree of convergence could not be obtained.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Road assignment—III


    Subtitle :

    Comparative tests of stochastic methods


    Contributors:

    Publication date :

    1975-08-28


    Size :

    7 pages




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English



    Road assignment—II

    Van Vliet, Dirck | Elsevier | 1975


    Road assignment—I

    Van Vliet, Dirck | Elsevier | 1975


    Traffic assignment to road network

    Almond, J. | Engineering Index Backfile | 1965


    Road traffic assignment — a review

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


    Road traffic assignment—a review

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