A Path-Based Gradient Projection Algorithm for the Cost-Based System Optimum Problem in Networks with Continuously Distributed Value of Time. (20th March 2014)

• Record Type: Journal Article
• Authors: Wu, Wen-Xiang; Huang, Hai-Jun
• Other Names: Liao Ching-Jong Academic Editor.
• Is Part Of: Journal of applied mathematics. Volume 2014(2014)
• Publication Date: 2014-03-20
• Subjects: Mathematics -- Periodicals; 519.05
• DOI: 10.1155/2014/271358
• Languages: English
• ISSNs: 1110-757X

Abstract

Abstract : 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.