A family of algorithms for assigning trips onto a road network is developed based on "stochastic" models of route choice which explicity 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. /Author/

  • Corporate Authors:

    Pergamon Press, Incorporated

    Maxwell House, Fairview Park
    Elmsford, NY  United States  10523
  • Authors:
    • Van Vliet, D
  • Publication Date: 1976-4

Media Info

  • Features: Figures; References; Tables;
  • Pagination: p. 151-157
  • Serial:

Subject/Index Terms

Filing Info

  • Accession Number: 00139610
  • Record Type: Publication
  • Files: TRIS
  • Created Date: Oct 6 1976 12:00AM