An accurate and efficient approach in equilibrium traffic assignment on congested networks. Paper presented at the 53rd Annual Meeting of the Highway Research Board HRB, Washington, D.C., January 1974.

Author(s)
Le Blanc, L.J. Morlok, E.K. & Pierskalla, W.P.
Year
Abstract

A new solution technique for the equilibrium traffic assignment problem is described. As stated, the algorithm promises to be efficient for finding the equilibrium on a network with hundreds of nodes inasmuch as its most difficult computational requirements are identical to those of the iterated capacity restraint simulation models of traffic assignment currently used.

Request publication

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

Publication

Library number
B 9253 (In: B 5421 S) /71/ IRRD 213862
Source

In: Transportation Research Record TRR No. 491, 1974, p. 12-23, 4 fig., 1 graph., 1 tab., 11 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.