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

Auteur(s)
Nishikawa, Y. & Nakahori, I.
Jaar
Samenvatting

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.

Publicatie aanvragen

6 + 2 =
Los deze eenvoudige rekenoefening op en voer het resultaat in. Bijvoorbeeld: voor 1+3, voer 4 in.

Publicatie

Bibliotheeknummer
B 14624 (In: B 14601) /71/72/ IRRD 236916
Uitgave

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.

Onze collectie

Deze publicatie behoort tot de overige publicaties die we naast de SWOV-publicaties in onze collectie hebben.