We present an application of Constraint Logic Programming (CLP) for finding the minimum number and location of count-posts
at urban roundabouts so as to obtain origin-destination data at minimum cost. By finding nice mathematical properties, we
were able to model this problem as a constraint satisfaction problem in finite domains, and use CLP(FD) systems to solve it,
with almost no implementation effort and very quickly.