### Abstract

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.

Original language | English (US) |
---|---|

Pages (from-to) | 254-263 |

Number of pages | 10 |

Journal | Transportation Science |

Volume | 21 |

Issue number | 4 |

DOIs | |

State | Published - Jan 1 1987 |

### Fingerprint

### All Science Journal Classification (ASJC) codes

- Civil and Structural Engineering
- Transportation

### Cite this

*Transportation Science*,

*21*(4), 254-263. https://doi.org/10.1287/trsc.21.4.254

}

*Transportation Science*, vol. 21, no. 4, pp. 254-263. https://doi.org/10.1287/trsc.21.4.254

**EQUILIBRIUM DECOMPOSED OPTIMIZTION : A HEURISTIC FOR THE CONTINUOUS EQUILIBRIUM NETWORK DESIGN PROBLEM.** / Suwansirikul, Chaisak; Friesz, Terry L.; Tobin, Roger L.

Research output: Contribution to journal › Article

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/1/1

Y1 - 1987/1/1

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

VL - 21

SP - 254

EP - 263

JO - Transportation Science

JF - Transportation Science

SN - 0041-1655

IS - 4

ER -