Optimal location of traffic counting points for estimating origin–destination trip matrix

This paper discusses how to determine the optimal number and locations of traffic counting points in a road network for estimating the origin–destination trip matrix. Based on location rules, a non-linear programming model for determining the optimal locations of traffic counting points is addressed under a given OD distribution pattern. Such problem can also be described as an average reward Markov decision process with additional constraints, which can be equivalent to an integer linear programming problem. The computational example shows that the results obtained are satisfactory.