Gradient Projection Algorithm Using Curry´s Steplength for Traffic Assignment

Recent researches have indicated the viability of path-based algorithms for traffic assignment problem and much attention has been received by gradient projection (GP) algorithm. However, the GP algorithm experiences problems near optimal point when trying to obtain high accurate results. To improve its performance near optimal point, this study employs bisection method to find the Curry´s steplength of each iteration as so to achieve that goal. A numerical example is provided to demonstrate the advantage of the GP algorithm using Curry´s steplength.