A Method to Improve the Route-Based Algorithm for Traffic Assignment by Eliminating Route Dependence

Along with the development of computation techniques, the storage memory is no longer a critical bottleneck to the solution algorithms for transportation network models. The researches of the traffic assignment problem (TAP) have focused on the large-scale problems with higher precise solutions. The route-based algorithms were reported to have a fast convergence speed to high precision. Thus, a new method is proposed to improve the route-based algorithms by eliminating the dependent routes in the set of active routes. The modification is carried out on the well-known projected gradient (PG) algorithm. According to the numerical experiments, the improved algorithm is demonstrated to be nearly two times faster than the original version, and is more space-saving. Other features are also analyzed from the results.

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

  American Society of Civil Engineers

  1801 Alexander Bell Drive
  Reston, VA  United States  20191-4400
• Authors:
  • Du, M
  • Jiang, X
  • Cheng, L
• Conference:
  • 16th COTA International Conference of Transportation Professionals
  • Location: Shanghai , China
  • Date: 2016-6-6 to 2016-6-9
• Publication Date: 2016

Language

• English

Media Info

• Media Type: Web
• Features: References;
• Pagination: pp 2286-2296
• Monograph Title: CICTP 2016: Green and Multimodal Transportation and Logistics

Subject/Index Terms

• TRT Terms: Algorithms; Routes; Traffic assignment
• Subject Areas: Highways; Operations and Traffic Management; Planning and Forecasting;

Filing Info

• Accession Number: 01609201
• Record Type: Publication
• ISBN: 9780784479896
• Files: TRIS, ASCE
• Created Date: Aug 30 2016 9:03AM