This paper utilizes the flow interception model with the objective of locating detectors on transportation network to maximize the no of intercepted violators who are threat for public safety. We install the detectors where peoples or cars come from the residential area near candidate location or flow passing by candidate location. Model was then solved using two approaches: a mathematical approach and a greedy heuristic approach. The results show that the improved greedy heuristic gives a solution that is very close to optimum in terms of the number of detectors needed to intercept a given percentage of the car flow. Several numerical experiments are conducted to illustrate the computational efficiency and solution quality of the proposed heuristic algorithm.