Tuydes-Yaman, HediyeAltintasi, OrucŞendil, Nuri2021-03-202021-03-2020150315-14681208-6029http://doi.org/10.1139/cjce-2014-0555https://hdl.handle.net/20.500.12885/1152Intersection movements carry more disaggregate information about origin-destination (O-D) flows than link counts in a traffic network. In this paper, a mathematical formulation is presented for O-D matrix estimation using intersection counts, which is based on an existing linear programming model employing link counts. The proposed model estimates static O-D flows for uncongested networks assuming no a priori information on the O-D matrix. Both models were tested in two hypothetical networks previously used in O-D matrix studies to monitor their performances assuming various numbers of count location and measurement errors. Two new measures were proposed to evaluate the model characteristics of O-D flow estimation using traffic counts. While both link count based and intersection count based models performed with the same success under complete data collection assumption, intersection count based formulation estimated the O-D flows more successfully under decreasing number of observation locations. Also, the results of the 30 measurement error scenarios revealed that it performs more robustly than the link count based one; thus, it better estimates the O-D flows.eninfo:eu-repo/semantics/closedAccessorigin-destination matrix estimationintersection movement countlink countautomated traffic countslinear programmingArticle10.1139/cjce-2014-0555427490502WOS:000357725300006Q3Q3