Premium
The stochastic close‐enough arc routing problem
Author(s) -
Renaud Alexandre,
Absi Nabil,
Feillet Dominique
Publication year - 2017
Publication title -
networks
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.977
H-Index - 64
eISSN - 1097-0037
pISSN - 0028-3045
DOI - 10.1002/net.21729
Subject(s) - heuristics , computer science , mathematical optimization , routing (electronic design automation) , arc routing , preprocessor , arc (geometry) , order (exchange) , operations research , mathematics , artificial intelligence , computer network , geometry , finance , economics
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. © 2016 Wiley Periodicals, Inc. NETWORKS, Vol. 69(2), 205–221 2017