TY - JOUR
T1 - OPTIMAL TRAFFIC ASSIGNMENT WITH ELASTIC DEMANDS
T2 - A REVIEW - 2. ALGORITHMIC APPROACHES.
AU - Gartner, Nathan H.
PY - 1980
Y1 - 1980
N2 - The paper examines algorithmic approaches for calculating the flow patterns resulting from the different modes of assignment. An efficient methodology for solving the elastic-demand TAP is based on remodeling it as an equivalent assignment problem in an expanded network. The variable-demand TAP is then transformed into a fixed-demand TAP, with a trip table consisting of the potential demands, and can be solved by available fixed-demand assignment algorithms. Three alternative transformations are described.
AB - The paper examines algorithmic approaches for calculating the flow patterns resulting from the different modes of assignment. An efficient methodology for solving the elastic-demand TAP is based on remodeling it as an equivalent assignment problem in an expanded network. The variable-demand TAP is then transformed into a fixed-demand TAP, with a trip table consisting of the potential demands, and can be solved by available fixed-demand assignment algorithms. Three alternative transformations are described.
UR - http://www.scopus.com/inward/record.url?scp=0019011138&partnerID=8YFLogxK
U2 - 10.1287/trsc.14.2.192
DO - 10.1287/trsc.14.2.192
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:0019011138
SN - 0041-1655
VL - 14
SP - 192
EP - 208
JO - Transportation Science
JF - Transportation Science
IS - 2
ER -