This paper discusses the slow-convergence characteristics of the Frank-Wolfe algorithm in the solution of the traffic assignment problem in transportation networks. The principal modifications proposed to improve the rate of convergence of the original method are examined and a new modification to the Frank-Wolfe algorithm is presented. Convergence of the algorithm is proved and computational results are reported to demonstrate the validity of the proposed method.
Convergence of the Frank-Wolfe algorithm in transportation networks
LUPI, MARINO
1986-01-01
Abstract
This paper discusses the slow-convergence characteristics of the Frank-Wolfe algorithm in the solution of the traffic assignment problem in transportation networks. The principal modifications proposed to improve the rate of convergence of the original method are examined and a new modification to the Frank-Wolfe algorithm is presented. Convergence of the algorithm is proved and computational results are reported to demonstrate the validity of the proposed method.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
