TY - JOUR
T1 - EQUILIBRIUM DECOMPOSED OPTIMIZTION
T2 - A HEURISTIC FOR THE CONTINUOUS EQUILIBRIUM NETWORK DESIGN PROBLEM.
AU - Suwansirikul, Chaisak
AU - Friesz, Terry L.
AU - Tobin, Roger L.
PY - 1987
Y1 - 1987
N2 - Numerical tests are reported which indicate that, for networks with significant congestion, the heuristic is markedly more efficient than the Hooke-Jeeves algorithm which has been employed previously. The efficiency of the heuristic results from decomposition of the original problem into a set of interacting optimization subproblems. This decomposition is such that, at each iteration of the algorithm, only one user equilibrium needs to be calculated in order to update the improvement variables of all arcs of the network. This contrasts sharply with the Hooke-Jeeves algorithm which can require that a new user equilibrium be calculated each time an individual arc improvement variable is updated.
AB - Numerical tests are reported which indicate that, for networks with significant congestion, the heuristic is markedly more efficient than the Hooke-Jeeves algorithm which has been employed previously. The efficiency of the heuristic results from decomposition of the original problem into a set of interacting optimization subproblems. This decomposition is such that, at each iteration of the algorithm, only one user equilibrium needs to be calculated in order to update the improvement variables of all arcs of the network. This contrasts sharply with the Hooke-Jeeves algorithm which can require that a new user equilibrium be calculated each time an individual arc improvement variable is updated.
UR - http://www.scopus.com/inward/record.url?scp=0023455739&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0023455739&partnerID=8YFLogxK
U2 - 10.1287/trsc.21.4.254
DO - 10.1287/trsc.21.4.254
M3 - Article
AN - SCOPUS:0023455739
SN - 0041-1655
VL - 21
SP - 254
EP - 263
JO - Transportation Science
JF - Transportation Science
IS - 4
ER -