SIMPLICIAL DECOMPOSITION OF THE ASYMMETRIC TRAFFIC ASSIGNMENT PROBLEM

This paper presents a convergent simplicial decomposition algorithm for the variational inequality formulation of the asymmetric traffic assignment problem. It alternates between generating minimum path trees based on the cost function evaluated at the current iterate and the approximate solving of a master variational inequality subject to simple convexity constraints. Thus it generalizes the popular Frank-Wolfe method (where the master problem is a line search) to the asymmetric problem. Rules are given for dropping flow patterns which are not needed to express the current iterate as a convex combination of previous patterns. The results of some computational testing are reported. (Author/TRRL)

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

  Pergamon Press, Incorporated

  Headington Hill Hall
  Oxford OX30BW,    
• Authors:
  • Lawphongpanich, S
  • Hearn, D W
• Publication Date: 1984-4

Media Info

• Features: Figures; References; Tables;
• Pagination: p. 123-133
• Serial:
  • Transportation Research Part B: Methodological
  • Volume: 18
  • Issue Number: 2
  • Publisher: Elsevier
  • ISSN: 0191-2615
  • Serial URL: http://www.sciencedirect.com/science/journal/01912615

Subject/Index Terms

• TRT Terms: Asymmetry; Costs; Mathematical models; Networks; Roads; Traffic assignment; Traffic flow
• Uncontrolled Terms: Models; Road networks
• ITRD Terms: 224: Cost; 6473: Mathematical model; 6425: Symmetry; 679: Traffic assignment; 671: Traffic flow
• Subject Areas: Finance; Highways; Operations and Traffic Management; I71: Traffic Theory;

Filing Info

• Accession Number: 00390748
• Record Type: Publication
• Source Agency: Transport Research Laboratory
• Files: ITRD, TRIS
• Created Date: Feb 28 1985 12:00AM