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.
RightsThis publication is a work of the U.S. Government as defined in Title 17, United States Code, Section 101. Copyright protection is not available for this work in the United States.
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 ...
A Method to Choose Between Automation and Human Operators for Recovery Actions During a Cyber Attack for Recovery Actions During a CyberAttack Van Bossuyt, Douglas L. (Elsevier, 2019);As complex systems such as nuclear power plants, naval ships, critical infrastructure, and other systems become more connected system increases. In many systems, recovery actions can prevent an incipient failure from causing ...
Analyzing the Effects of Source Selection Method, Acquisition Type, and Service Component on Acquisition Outcomes Landale, Karen A. F.; Rendon, Rene G. (Monterey, California. Naval Postgraduate School, 2017-03); SYM-AM-17-094For years, one of the most hotly contested debates in contracting and acquisition has been the choice of source selection method and the contract-related consequences of that choice. While policy memos encourage contracting ...