Abstract A dual decomposition algorithm is developed for large-scale traffic assignment problems. In contrast to standard methods, this algorithm does not require that the system or user optimal objective function be differentiable and it allows bounds on the arc flows. Iterates alternate between dual ascent steps and calculations of shortest paths as in the Frank-Wolfe method. Although a dual method, it produces feasible flow patterns at each iteration. Convergence of the method is proven and a computational example is given.
A dual ascent algorithm for traffic assignment problems
Transportation Research Part B: Methodological ; 24 , 6 ; 423-430
1990-01-01
8 pages
Article (Journal)
Electronic Resource
English
A primal-dual traffic assignment algorithm
Tema Archive | 1975
|Ascent Problems of Sounding Rockets
NTRS | 1961
|Dual-Ascent Procedures for Multicommodity Location-Allocation Problems with Balancing Requirements
Online Contents | 1993
|Ascent problems of sounding rockets
Engineering Index Backfile | 1961
|