An improved efficiency of the Frank-Wolfe algorithm for network traffic assignment

Abstract

Frank-Wolfe (denoted as F-W) algorithm has already been pointed out that the wrong traffic assignment will occur when parsing the statc of user equilibrium (denoted as UE). Besides, to obviate the non-UE paths by path data structure has been demonstrated to accelerate the rate of convergent speed. Therefore, how to decide a suitable threshold to shift. the flow from the Don-UE path to the other paths of the same origin-destination (denoted as OD) pair becomes a very important issue to enhance the rate of convergence. In this paper, an adequate threshold is proposed.