The equivalence of transfer and generalized benders decomposition methods for traffic assignment
In prior work we have given an intuitive development of Transfer Decomposition, a decomposition of the traffic assignment problem into two traffic assignment problems. The intent of this paper is to provide a rigorous basis for this technique by establishing that it is a generalized Benders decomposition. As an illustration of the result, we give a decomposition algorithm that is based on the familiar Frank-Wolfe method.
| Year of publication: |
1989
|
|---|---|
| Authors: | Barton, Russell R. ; Hearn, Donald W. ; Lawphongpanich, Siriphong |
| Published in: |
Transportation Research Part B: Methodological. - Elsevier, ISSN 0191-2615. - Vol. 23.1989, 1, p. 61-73
|
| Publisher: |
Elsevier |
Saved in:
Saved in favorites
Similar items by person
-
A dual ascent algorithm for traffic assignment problems
Hearn, Donald W., (1990)
-
Convex programming formulations of the asymmetric traffic assignment problem
Hearn, Donald W., (1984)
-
Congestion pricing for multi-modal transportation systems
Hamdouch, Younes, (2007)
- More ...