A dual ascent algorithm for traffic assi
β
Donald W. Hearn; Siriphong Lawphongpanich
π
Article
π
1990
π
Elsevier Science
π
English
β 551 KB
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