Properties of the iterative optimization-equilibrium algorithm
- 20 September 1985
- journal article
- research article
- Published by Taylor & Francis in Civil Engineering Systems
- Vol. 2 (3) , 142-154
- https://doi.org/10.1080/02630258508970398
Abstract
This paper shows that the iterative optimization-equilibrium algorithm used to solve the continuous network design problem does not solve the original Abdulaal-LeBlanc normative network design model, but rather is an exact and efficient solution procedure for a descriptive model in which the planner and the network users compete in a Cournot-Nash setting. The existence of a solution to this descriptive model is proved, numerical results which illustrate convergence and efficiency of the algorithm are given, and suggestions for future research are made.Keywords
This publication has 16 references indexed in Scilit:
- A solution condition for complementarity problems: with an application to spatial price equilibriumApplied Mathematics and Computation, 1984
- Equilibrium predictions in transportation markets: The state of the artTransportation Research Part B: Methodological, 1983
- Approximate algorithms for the discrete network design problemTransportation Research Part B: Methodological, 1982
- A note of network equilibrium and noncooperative gamesTransportation Research Part B: Methodological, 1981
- The existence, uniqueness and stability of traffic equilibriaTransportation Research Part B: Methodological, 1979
- Methods for Combining Modal Split and Equilibrium Assignment ModelsTransportation Science, 1979
- Continuous equilibrium network design modelsTransportation Research Part B: Methodological, 1979
- An Algorithm for the Discrete Network Design ProblemTransportation Science, 1975
- Braess's paradox of traffic flowTransportation Research, 1970
- On some non-linear elliptic differential-functional equationsActa Mathematica, 1966