Dynamic traffic assignment by individual path minimization and queuing.

Author(s)
Yagar, S.
Year
Abstract

Methods of assigning non-varying demands to a network are extended to allow for time-varying demands. This is accomplished by breaking up the time period over which the demand varies into time slices which are sufficiently short that they can be considered to have non-varying demands.

Request publication

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

Publication

Library number
B 2324 T /71/ IRRD 202768
Source

Transportation Research, Vol. 5 (1971), No. 3 (August), p. 179-196, 13 fig., 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.