 Optimal traffic counting locations for origin-destination matrix estimationHai Yang and Jing Zhou Transportation Research Part B: Methodological, 1998, vol. 32, issue 2, 109-126 Abstract: There has been substantial interest in development and application of methodology for estimating origin-destination (O-D) trip matrices from traffic counts. Generally, the quality of an estimated O-D matrix depends much on the reliability of the input data, and the number and locations of traffic counting points in the road network. The former has been investigated extensively, while the latter has received very limited attention. This paper addresses the problem of how to determine the optimal number and locations of traffic counting points in a road network for a given prior O-D distribution pattern. Four location rules: O-D covering rule, maximal flow fraction rule, maximal flow-intercepting rule and link independence rule are proposed, and integer linear programming models and heuristic algorithms are developed to determine the counting links satisfying these rules. The models and algorithms are illustrated with numerical examples. Date: 1998 Downloads: (external link) Related works: Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text Persistent link: https://EconPapers.repec.org/RePEc:eee:transb:v:32:y:1998:i:2:p:109-126 Ordering information: This journal article can be ordered from Access Statistics for this article Transportation Research Part B: Methodological is currently edited by Fred Mannering More articles in Transportation Research Part B: Methodological from Elsevier |
Is your work missing from RePEc? Here is how to contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .
EconPapers is hosted by the
School of Business at Örebro University.