The traffic assignment problem for a general network.

Author(s)
Dafermos, S.C. & Sparrow, T.
Year
Abstract

A transportation network is considered. The traffic demands associated with pairs of nodes and the (convex) travelling cost functions associated with the links are assumed given. The two problems of finding the traffic patterns which either minimize the total cost or equilibrate the users costs are formulated, and algorithms are constructed for the solution of these problems.

Request publication

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

Publication

Library number
A 4086 fo
Source

Mathematical Science: Section B. Journal of Research, Vol. 73B (1969), No. 2 (April-June), p. 91-118.

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.