The stochastic close-enough arc routing problem

详细信息    查看全文

• 作者：Alexandre Renaud ; Nabil Absi and Dominique Feillet
• 刊名：Networks
• 出版年：2017
• 出版时间：March 2017
• 年：2017
• 卷：69
• 期：2
• 页码：205-221
• 全文大小：4750K
• ISSN：1097-0037

文摘

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.