The Stochastic Close-Enough Arc Routing Problem (SCEARP) is a challenging problem where utility companies seek for a minimum-cost tour in order to collect meter consumption remotely. The stochasticity lies in the uncertainty of collecting data due to failed transmissions. In this article, we propose a mathematical formulation for this problem. We introduce some preprocessing properties, develop an exact method and several heuristics. Computational results from experiments are presented and analyzed.