详情

原文传递 ACCELERATING STRATEGIES AND COMPUTATIONAL STUDIES OF THE FRANK-WOLFE ALGORITHM FOR THE TRAFFIC ASSIGNMENT PROBLEM.

题名：	ACCELERATING STRATEGIES AND COMPUTATIONAL STUDIES OF THE FRANK-WOLFE ALGORITHM FOR THE TRAFFIC ASSIGNMENT PROBLEM.
作者：	Lee-D-H; Nie-Y
关键词：	Accelerating-strategies; Accuracy-; Algorithms-; Data-processing-time; Traffic-assignment
摘要：	An accelerating strategy to the well-known Frank-Wolfe algorithm for solution of the traffic assignment problem (TAP) is presented here. The Frank-Wolfe algorithm has been widely accepted and recognized by transportation researchers and practitioners as a state-of-the-practice solution method for TAP. With abundant numerical examples, the proposed accelerating strategy was compared with other accelerating methods, such as the parallel tangent technique, Fukushima direction, and Weintraub step size. The computational results successfully indicate that this new strategy is capable of obtaining highly accurate solutions with relatively moderate central processing unit time consumed. The computational results also indicate that the performance of this accelerating strategy is better than state-of-the-art algorithms, such as the restricted simplicial decomposition algorithm and the gradient projection algorithm. The proposed accelerating strategy is easy to implement and suitable for obtaining accurate solutions to TAP because of its economical memory requirement and stable performance, even when large and congested networks are considered.
总页数：	Transportation Research Record. 2001. (1771) pp97-105 (6 Fig., 3 Tab., 21 Ref.)
报告类型：	科技报告