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 ...
Pearce, Cliff P. (Monterey, California: Naval Postgraduate School, 1999-03);A method of structural synthesis is presented using a recursive computational process. A structure can be modeled entirely linearly, with localized nonlinearities included as synthesized forces. The method allows retention ...
Dorf, Richard Carl (Monterey, California: U.S. Naval Postgraduate School, 1961-05-01);The aim of this dissertation is to present a new method of engineering analysis and design for complex control systems. This method is the time domain infinite matrix method. The formulation of the infinite matrix follows ...