BICRITERION TRAFFIC ASSIGNMENT: EFFICIENT ALGORITHMS PLUS EXAMPLES

This paper describes the mathematical properties and solution algorithm of a stochastic bicriterion equilibrium traffic assignment model in which both criteria may be flow-dependent. Formulated as a variational inequality, the model can reflect that different trip makers -- due to habit, taste, or information -- react differently to various factors such as travel time, out-of-pocket cost, and traffic congestion. Combining a novel tree builder/trip loader that obviates path enumeration together with Newton's method and linear programming, its reduced simplicial decomposition solution algorithm is fast enough to make the model a practical planning tool.

• Availability:
  • Find a library where document is available. Order URL: http://worldcat.org/issn/01912615
• Corporate Authors:

  Elsevier

  The Boulevard, Langford Lane
  Kidlington, Oxford  United Kingdom  OX5 1GB
• Authors:
  • Dial, R B
• Publication Date: 1997-10

Language

• English

Media Info

• Features: Figures; References;
• Pagination: p. 357-379
• Serial:
  • Transportation Research Part B: Methodological
  • Volume: 31
  • Issue Number: 5
  • Publisher: Elsevier
  • ISSN: 0191-2615
  • Serial URL: http://www.sciencedirect.com/science/journal/01912615

Subject/Index Terms

• TRT Terms: Decomposition; Linear programming; Traffic assignment; Traffic models; Trip distribution
• Old TRIS Terms: Trip distribution models
• Subject Areas: Highways; Operations and Traffic Management; I71: Traffic Theory;

Filing Info

• Accession Number: 00741269
• Record Type: Publication
• Files: TRIS, ATRI
• Created Date: Oct 23 1997 12:00AM