The Stochastic Close-Enough Arc Routing Problem - Mines Saint-Étienne Access content directly
Journal Articles Networks Year : 2017

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.
No file

Dates and versions

emse-01421628 , version 1 (22-12-2016)

Identifiers

  • HAL Id : emse-01421628 , version 1

Cite

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

Share

Gmail Facebook X LinkedIn More