Abstract This paper examines different formulations for estimating trip matrices on congested networks from link traffic count data. It is shown that several existing approaches can be expected to produce the same results when observed counts constitute a user optimal link flow pattern. This has important practical implications because of the computational difficulties associated with some of the formulations.
Trip matrix estimation from link traffic counts: The congested network case
Transportation Research Part B: Methodological ; 23 , 5 ; 331-336
1988-12-02
6 pages
Aufsatz (Zeitschrift)
Elektronische Ressource
Englisch
The most likely trip matrix estimated from traffic counts
Elsevier | 1979
|Algorithms for the Solution of the Congested Trip Matrix Estimation Problem
British Library Conference Proceedings | 1999
|A note on trip matrix estimation from link traffic count data
Elsevier | 1982
|Updating demand vectors using traffic counts on congested networks: a real case application
British Library Conference Proceedings | 2007
|