This work tackles the Traffic Counting Location Problem (TCLP), where we aim finding the best number and location of counting stations to cover a road network in order to obtain its traffic flows. It is important to reduce deployment, maintenance and operation costs of traffic stations. We propose a progressive hybrid algorithm based on exact, heuristic and hybrid approaches embedded on a set covering framework to solve the TCLP. This algorithm employs a simple and innovative concept which has not yet been explored in the literature. Twenty-six real-world instances obtained from the Brazilian states are used in the computational experiments and the results show that the TCLP can be solved more efficiently than previous approaches, with $84\%$ of the instances solved optimally, and three new best known solutions found.

这项工作解决了交通计数位置问题（TCLP），我们的目标是找到覆盖道路网络的最佳计数站位置和数量，以获取其交通流量。重要的是减少交通站点的部署，维护和运营成本。我们提出了一种基于嵌入在一组覆盖框架中的精确，启发式和混合方法的渐进混合算法，以解决TCLP。该算法采用了一种简单而创新的概念，该概念尚未在文献中进行探讨。从巴西各州获得的26个现实世界实例用于计算实验，结果表明TCLP可以比以前的方法更有效地解决，$84％$ 实例的最优解，找到了三个新的最著名的解决方案。