CONVEX PROGRAMMING FORMULATIONS OF THE ASYMMETRIC TRAFFIC ASSIGNMENT PROBLEM

Recently introduced optimization formulations of the asymmetric traffic assignment problem are developed. The duality of two formulations is shown, and conditions for convexity and differentiability of the objective functions are given. Convexity conditions are also given for the family of formulations recently introduced by Smith (1983). When the travel cost vector is affine and monotone, all of the formulations are shown to be convex programming problems. Algorithmic implications of the results are discussed. (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:
  • Hearn, D W
  • Lawphongpanich, S
  • Nguyen, S
• Publication Date: 1984

Media Info

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

Subject/Index Terms

• TRT Terms: Algorithms; Asymmetry; Computer programming; Costs; Mathematical models; Optimization; Traffic assignment; Travel; Travel budgets; Travel costs
• Uncontrolled Terms: Optimum; Programming
• ITRD Terms: 224: Cost; 698: Journey; 6473: Mathematical model; 679: Traffic assignment
• Subject Areas: Finance; Highways; Operations and Traffic Management; I71: Traffic Theory;

Filing Info

• Accession Number: 00396614
• Record Type: Publication
• Source Agency: Transport Research Laboratory
• Files: ITRD, TRIS
• Created Date: Sep 30 1985 12:00AM