A DUAL ASCENT ALGORITHM FOR TRAFFIC ASSIGNMENT PROBLEMS

A dual decomposition algorithm is developed for large-scale traffic assignment problems. In contrast to standard methods, this algorithm does not require that the system or user optimal objective function be differentiable and it allows bounds on the arc flows. Iterates alternate between dual ascent steps and calculations of shortest paths as in the Frank-Wolfe method. Although a dual method, it produces feasible flow patterns at each iteration. Convergence of the method is proven and a computational example is given.

• 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:
  • Hearn, D W
  • Lawphongpanich, S
• Publication Date: 1990-12

Media Info

• Features: References; Tables;
• Pagination: p. 423-430
• Serial:
  • Transportation Research Part B: Methodological
  • Volume: 24B
  • Issue Number: 6
  • Publisher: Elsevier
  • ISSN: 0191-2615
  • Serial URL: http://www.sciencedirect.com/science/journal/01912615

Subject/Index Terms

• TRT Terms: Algorithms; Iterative methods; Mathematical models; Traffic assignment; Traffic conflicts
• Subject Areas: Highways; Operations and Traffic Management;

Filing Info

• Accession Number: 00615033
• Record Type: Publication
• Files: TRIS, ATRI
• Created Date: Sep 30 1991 12:00AM