A network theoretic formulation and algorithms for the traffic assignment problem.

Author(s)
Nishikawa, Y. & Nakahori, I.
Year
Abstract

The traffic assignment problem in a traffic flow network is considered. A network of the problem is defined by a set of arcs connecting nodes, origin-destination (OD) pairs and unilateral paths connecting the OD pairs. By means of a graph theoretical approach, fundamental equations for the so-called equal-cost assignment have been derived in Vector-matrix forms, and new algorithms are constructed based on these fundamental equations.

Request publication

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

Publication

Library number
B 14624 (In: B 14601) /71/72/ IRRD 236916
Source

In: Proceedings of the 7th International Symposium on Transportation and Traffic Theory, Kyoto, August 14-17, 1977, p. 531- 544, 1 fig., 3 tab., 10 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.