The Stochastic Close-Enough Arc Routing Problem - Mines Saint-Étienne
Article Dans Une Revue Networks Année : 2017

The Stochastic Close-Enough Arc Routing Problem

Résumé

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.
Fichier non déposé

Dates et versions

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

Identifiants

  • HAL Id : emse-01421628 , version 1

Citer

Alexandre Renaud, Nabil Absi, Dominique Feillet. The Stochastic Close-Enough Arc Routing Problem. Networks, 2017, 69 (2), pp.205-221. ⟨emse-01421628⟩
95 Consultations
0 Téléchargements

Partager

More