Using Power Penalty Method in a Simple Decomposition Algorithm for the Asymmetric Traffic Assignment Problem

The asymmetric traffic assignment problem can be formulated as a variational inequality (VI), and the class of simplicial decomposition algorithms has been shown to be efficient for this problem. It alternates between generating shortest paths based on the travel cost function evaluated at the current iteration and solving the master problem that is a linearly constrained VI. The authors propose to use the recently proposed power penalty method to solve these VIs. The numerical results show that the proposed method can obtain a highly accurate solution with less computing time.

• Record URL:
  • https://doi.org/10.1061/9780784413159.037
• Availability:
  • Find a library where document is available. Order URL: http://worldcat.org/isbn/9780784413159
• Supplemental Notes:
  • © 2013 American Society of Civil Engineers.
• Corporate Authors:

  American Society of Civil Engineers

  1801 Alexander Bell Drive
  Reston, VA  United States  20191-4400
• Authors:
  • Chen, Ming
  • Huang, Chongchao
• Conference:
  • Fourth International Conference on Transportation Engineering
  • Location: Chengdu , China
  • Date: 2013-10-19 to 2013-10-20
• Publication Date: 2013-10

Language

• English

Media Info

• Media Type: Web
• Pagination: pp 252-257
• Monograph Title: ICTE 2013: Safety, Speediness, Intelligence, Low-Carbon, Innovation

Subject/Index Terms

• TRT Terms: Algorithms; Shortest path algorithms; Traffic assignment; Variational inequalities
• Subject Areas: Planning and Forecasting; Transportation (General); I72: Traffic and Transport Planning;

Filing Info

• Accession Number: 01505629
• Record Type: Publication
• ISBN: 9780784413159
• Files: TRIS, ASCE
• Created Date: Jan 27 2014 11:27AM