The equivalence of transfer and generalized benders decomposition methods for traffic assignment

Russell R. Barton; Donald W. Hearn; Siriphong Lawphongpanich

doi:10.1016/0191-2615(89)90024-6

The equivalence of transfer and generalized benders decomposition methods for traffic assignment

Russell R. Barton
, Donald W. Hearn
, Siriphong Lawphongpanich

Research output: Contribution to journal › Article › peer-review

12 Scopus citations

Abstract

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.

Original language	English (US)
Pages (from-to)	61-73
Number of pages	13
Journal	Transportation Research Part B
Volume	23
Issue number	1
DOIs	https://doi.org/10.1016/0191-2615(89)90024-6
State	Published - Feb 1989

All Science Journal Classification (ASJC) codes

Civil and Structural Engineering
Transportation

Access to Document

10.1016/0191-2615(89)90024-6

Cite this

@article{a890c0390adf45ad82d3bbfc7277d5bb,

title = "The equivalence of transfer and generalized benders decomposition methods for traffic assignment",

abstract = "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.",

author = "Barton, \{Russell R.\} and Hearn, \{Donald W.\} and Siriphong Lawphongpanich",

note = "Funding Information: tThis research was supported in part by the National Science Foundation under Grant CEE-8420830.",

year = "1989",

month = feb,

doi = "10.1016/0191-2615(89)90024-6",

language = "English (US)",

volume = "23",

pages = "61--73",

journal = "Transportation Research Part B",

issn = "0191-2615",

publisher = "Elsevier Ltd",

number = "1",

}

TY - JOUR

T1 - The equivalence of transfer and generalized benders decomposition methods for traffic assignment

AU - Barton, Russell R.

AU - Hearn, Donald W.

AU - Lawphongpanich, Siriphong

N1 - Funding Information: tThis research was supported in part by the National Science Foundation under Grant CEE-8420830.

PY - 1989/2

Y1 - 1989/2

N2 - 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.

AB - 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.

UR - https://www.scopus.com/pages/publications/23144436176

UR - https://www.scopus.com/pages/publications/23144436176#tab=citedBy

U2 - 10.1016/0191-2615(89)90024-6

DO - 10.1016/0191-2615(89)90024-6

M3 - Article

AN - SCOPUS:23144436176

SN - 0191-2615

VL - 23

SP - 61

EP - 73

JO - Transportation Research Part B

JF - Transportation Research Part B

IS - 1

ER -

The equivalence of transfer and generalized benders decomposition methods for traffic assignment

Abstract

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this