Article ID: | iaor201726 |
Volume: | 69 |
Issue: | 2 |
Start Page Number: | 205 |
End Page Number: | 221 |
Publication Date: | Mar 2017 |
Journal: | Networks |
Authors: | Feillet Dominique, Absi Nabil, Renaud Alexandre |
Keywords: | stochastic processes, combinatorial optimization, statistics: sampling, heuristics, energy |
The Stochastic Close‐Enough Arc Routing Problem 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.