STOCHASTIC NETWORKS AND TRAFFIC ASSIGNMENT

This paper explores the use of some stochastic models for traffic assignment in the case of homogeneous traffic and simple networks. For non-dynamic routing we obtain asymptotic results in the form of paths representing time dependent evolution of traffic over routes. A functional limit theorem gives integral equations for the limiting fluid path which converges to an assignment satisfying Wardrop's first principle as time goes to infinity. For linear cost functions we are able to use the theory of large deviations to examine the way in which rare network overload events occur. In the case of dynamic assignment, we discuss the use of heavy traffic limits and Brownian models to examine the efficiency of network capacity usage when drivers choose routes according to conditions obtaining on entrance to the network. In particular we discuss the phenomenon of resource pooling.

• Availability:
  • Find a library where document is available. Order URL: http://worldcat.org/isbn/0080434304
• Supplemental Notes:
  • This book is also available in the USA and Canada from Elsevier Science Inc., P.O. Box 945, Madison Square Station, New York, NY 10160-0757.
• Corporate Authors:

  Elsevier

  The Boulevard, Langford Lane
  Kidlington, Oxford  United Kingdom  OX5 1GB
• Authors:
  • EVANS, S P
• Conference:
  • Third IMA International Conference on Mathematics in Transport Planning and Control
  • Location: Cardiff, United Kingdom
  • Date: 1998-4-1 to 1998-4-3
• Publication Date: 1998

Language

• English

Media Info

• Features: References;
• Pagination: p. 109-118

Subject/Index Terms

• TRT Terms: Dynamic traffic assignment; Mathematical models; Stochastic processes; Traffic assignment
• Subject Areas: Data and Information Technology; Highways; Operations and Traffic Management;

Filing Info

• Accession Number: 00763016
• Record Type: Publication
• ISBN: 0080434304
• Files: TRIS
• Created Date: Apr 12 1999 12:00AM