Advanced Search

Query:

Fill in the form and click »Search«...

Format:

Display: entries per page entries

Zbl 0638.90097
Suwansirikul, Chaisak; Friesz, Terry L.; Tobin, Roger L.
Equilibrium decomposed optimization: A heuristic for the continuous equilibrium network design problem. (English)
[J] Transp. Sci. 21, 254-263 (1987). ISSN 0041-1655

For applications of realistic size, both the discrete and continuous versions of the equilibrium network design problem are too computationally intensive to be solved exactly with the algorithms proposed to date. This intractibility owes to Braess' paradox which makes it necessary to constrain the flow pattern to be a noncooperative Nash or user equilibrium. This paper suggests a new heuristic for finding an approximate solution to the continuous equilibrium network design problem. 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.

MSC 2000:: *90C35 Network programming
65K05 Mathematical programming (numerical methods)
90B10 Flows in networks

Keywords: transportation; Braess' paradox; heuristic; approximate solution; continuous equilibrium network design problem; decomposition; interacting optimization subproblems

Cited in: Zbl 0723.90070

Comment on this Item PDF MathML XML ASCII DVI PS BibTeX Online Ordering Article Journal Journal

	Scientific prize winners of the ICM 2010
	Overhang
	Lie groups, physics and geometry. An introduction for physicists, engineers and chemists.

Advanced Search

Zentralblatt MATH Berlin [Germany]