A network optimization problem is formulated which yields a probabilistic equilibrated traffic assignment incorporating congestion effects and which as a special case, reduces to a user optimized equilibrium solution. In the resulting model, path choice is determined by a logit formula in which path costs are functions of the assigned flows. The article also demonstrates the similarity between some fixed demand incremental methods of traffic assignment and the minimization problem associated with computing the user equilibrium assignment. (a) (TRRL)

  • Availability:
  • Supplemental Notes:
    • Sponsored by British Columbia University and Montreal University.
  • Corporate Authors:

    Pergamon Press, Incorporated

    Headington Hill Hall
    Oxford OX30BW,    
  • Authors:
    • Fisk, C
  • Publication Date: 1980-9

Media Info

Subject/Index Terms

Filing Info

  • Accession Number: 00324841
  • Record Type: Publication
  • Source Agency: Transport Research Laboratory
  • Report/Paper Numbers: HS-030 091
  • Files: HSL, ITRD, TRIS
  • Created Date: Jun 12 1983 12:00AM