Bounding the solution of the continuous equilibrium network design problem.

Author(s)
Harker, P.T. & Friesz, T.L.
Year
Abstract

The solution of the optimal equilibrium network design problem is perhaps the most computationally intensive problem encountered in transportation network analysis. This paper illustrates through the use of game-theoretic concepts how one can bound the solution of the continuous version of this problem by using two computationally efficient heuristics.

Request publication

4 + 1 =
Solve this simple math problem and enter the result. E.g. for 1+3, enter 4.

Publication

Library number
B 23332 (ln: B 23320) /71/ IRRD 277222
Source

In: Proceedings of the 9th International Symposium on Transportation and Traffic Theory, Delft, The Netherlands, July 11-13, 1984, p. 233-252, fig., graph., tab., ref.

Our collection

This publication is one of our other publications, and part of our extensive collection of road safety literature, that also includes the SWOV publications.