| Abrahamsson T.: Estimation of Origin-Destination Matrices using Trac Counts { A Literature Survey. IR-98-021/May, IIASA, Austria, 1998. |
....of cars going from i to j The area can be represented as a graph, as in Fig. 4, and the traffic flow problem be cast as a graph flow problem. The nature of the problem is the same as a well known one: the determination of source destination traffic on computer networks based on link measurements [1]. Let the graph have N nodes and P links. There are c = N(N 1) possible sourcedestination pairs in the network. Let X j (t) j = 1 . c be the traffic intensity on the j th such pair at time t, and set X(t) X 1 (t) X c (t) # . Let A be the Pc routing matrix whose elements ....
T. Abrahamsson. Estimation of origin-destination matrices using traffic count--a literature survey. Interim Report IR98 -021, International institute for Applied System Analysis, Laxenburg, Austria, May 1998.
No context found.
Abrahamsson T.: Estimation of Origin-Destination Matrices using Trac Counts { A Literature Survey. IR-98-021/May, IIASA, Austria, 1998.
No context found.
Abrahamsson, Torgil. (1998), Estimation of Origin-Destination Matrices using Trac Counts - A Literature Survey, IIASA Interim Report IR-98-021/May.
No context found.
T. Abrahamsson, "Estimation of origin-destination matrices using tra#c count--a literature survey," Interim Report IR-98-021, International institute for Applied System Analysis, Laxenburg, Austria, May 1998.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC