A FULL ANALYTICAL IMPLEMENTATION OF THE PARTAN FRANK-WOLFE ALGORITHM FOR EQUILIBRIUM ASSIGNMENT

The FRANK-WOLFE algorithm is the most commonly used algorithm to solve the traffic assignment problem. PARTAN (short for parallel tangent) is a variation on Frank-Wolfe that tries to speed up the convergence by introducing an extra line search in the algorithm. We show that an essential step in the PARTAN variant of the Frank-Wolfe algorithm for equilibrium assignment, the calculation of a minimal step length for maintaining feasibility, can be accomplished using either analytical formulas or simple rules.