A Path-Based Gradient Projection Algorithm for the Cost-Based System Optimum Problem in Networks with Continuously Distributed Value of Time
Keyword(s):
The cost-based system optimum problem in networks with continuously distributed value of time is formulated as a path-based form, which cannot be solved by the Frank-Wolfe algorithm. In light of magnitude improvement in the availability of computer memory in recent years, path-based algorithms have been regarded as a viable approach for traffic assignment problems with reasonably large network sizes. We develop a path-based gradient projection algorithm for solving the cost-based system optimum model, based on Goldstein-Levitin-Polyak method which has been successfully applied to solve standard user equilibrium and system optimum problems. The Sioux Falls network tested is used to verify the effectiveness of the algorithm.
1992 ◽
Vol 8
(4)
◽
pp. 323-332
2021 ◽
Vol 693
(1)
◽
pp. 012096
2013 ◽
Vol 13
(1(2))
◽
pp. 33-38
Keyword(s):
Keyword(s):
2020 ◽
Vol 1575
◽
pp. 012021