A Comparison between Gradient Projection Methods For Traffic Assignment Problem
Publish place: 9th International Congress on Civil Engineering
Publish Year: 1391
Type: Conference paper
Language: English
View: 1,992
This Paper With 7 Page And PDF Format Ready To Download
- Certificate
- I'm the author of the paper
Export:
Document National Code:
ICCE09_1273
Index date: 28 September 2012
A Comparison between Gradient Projection Methods For Traffic Assignment Problem abstract
Recently, gradient projection (GP) has been extended as efficient algorithms for solving the traffic assignment problem (TAP). In this paper, two distinguished GP methods for TAP are investigated. Theyare an algorithm to apply Bertsekas`s GP method and an algorithm to apply Rosen's GP method. They confront the problem in the same way, but with various descent directions and step sizes. The efficiency of the algorithms is compared using large-scale test networks. Algorithms are developed ina same platform and compared based on the computational efforts for reaching given accuracies. The results show that the algorithm using Bertsekas`s GP converges more rapidly than another using Rosen's GP.
A Comparison between Gradient Projection Methods For Traffic Assignment Problem Keywords:
A Comparison between Gradient Projection Methods For Traffic Assignment Problem authors
Babak Javani
Ph.D. student, School of Civil Engineering, University of Tehran, Tehran
Abbas Babazadeh
Assistant professor, School of Civil Engineering, University of Tehran