Open Access
Translator Disclaimer
2014 A Path-Based Gradient Projection Algorithm for the Cost-Based System Optimum Problem in Networks with Continuously Distributed Value of Time
Wen-Xiang Wu, Hai-Jun Huang
J. Appl. Math. 2014: 1-9 (2014). DOI: 10.1155/2014/271358

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.

Citation

Download Citation

Wen-Xiang Wu. Hai-Jun Huang. "A Path-Based Gradient Projection Algorithm for the Cost-Based System Optimum Problem in Networks with Continuously Distributed Value of Time." J. Appl. Math. 2014 1 - 9, 2014. https://doi.org/10.1155/2014/271358

Information

Published: 2014
First available in Project Euclid: 2 March 2015

zbMATH: 07010583
Digital Object Identifier: 10.1155/2014/271358

Rights: Copyright © 2014 Hindawi

JOURNAL ARTICLE
9 PAGES


SHARE
Vol.2014 • 2014
Back to Top