Skip to Main content Skip to Navigation
Journal articles

The Stochastic Close-Enough Arc Routing Problem

Abstract : 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.
Document type :
Journal articles
Complete list of metadata
Contributor : Dominique Feillet Connect in order to contact the contributor
Submitted on : Thursday, December 22, 2016 - 4:01:01 PM
Last modification on : Sunday, June 26, 2022 - 9:36:57 AM


  • HAL Id : emse-01421628, version 1


Alexandre Renaud, Nabil Absi, Dominique Feillet. The Stochastic Close-Enough Arc Routing Problem. Networks, Wiley, 2017, 69 (2), pp.205-221. ⟨emse-01421628⟩



Record views