A dual ascent algorithm for traffic assignment problems
Hearn, Donald W.
MetadataShow full item record
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.
Showing items related by title, author, creator and subject.
Nagashima, M.; Agrawal, B.N. (2012);For a large Adaptive Optics (AO) system such as a large Segmented Mirror Telescope (SMT), it is often difficult, although not impossible, to directly apply common Multi-Input Multi-Output (MIMO) controller design methods ...
Neta, Beny (2010-04);Several one-parameter families of fourth-order methods for finding multiple zeros of non-linear functions are developed. The methods are based on Murakami's fifth-order method (for simple roots) and they require one ...
Song, G.; N. Buck; Agrawal, B.N. (1997);Minimizing vibrations of a exible spacecraft actuated by on-off thrusters is a challenging task. This paper presents the rst study of pulse-width pulse-frequency modulated thruster control using command input shaping. ...