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.


  • 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

Filing Info

  • Accession Number: 01609201
  • Record Type: Publication
  • ISBN: 9780784479896
  • Files: TRIS, ASCE
  • Created Date: Jun 29 2016 3:08PM