A traffic assignment planning model: The load-node concept

Wilson, E M; Matthias, Judson S; Betz, Mathew J

doi:10.1016/0041-1647(74)90020-3

Search citation statements

Order By: Relevance

Paper Sections

Select...

Transfer Decomposition Motivation and Theory1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

1989

1991

Publication Types

Select...

Article2

Relationship

Self Cite0

Independent2

Authors

Journals

Cited by 2 publications

(1 citation statement)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Transfer Decomposition was developed during a study of an ad hoc decomposition process used by transportation planners to solve large (10,000 links) traffic assignment problems (Wilson et al, 1974;Hearn, 1978). The steps in this process were: (1) extract a relatively small subnetwork of primary interest, (2) transfer part or all of the complete trip demand matrix to a subnetwork demand matrix, and (3) flow the smaller tractable network.…”

Section: Transfer Decomposition Motivation and Theorymentioning

confidence: 99%

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

Barton

Hearn

Lawphongpanich

1989

Transportation Research Part B: Methodological

View full text Add to dashboard Cite

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.

show abstract

Section: Transfer Decomposition Motivation and Theorymentioning

confidence: 99%