| Article ID: | iaor201522233 |
| Volume: | 63 |
| Issue: | 1 |
| Start Page Number: | 107 |
| End Page Number: | 118 |
| Publication Date: | Jan 2014 |
| Journal: | Networks |
| Authors: | Langevin Andr, Rousseau Louis-Martin, Bostel Nathalie, H Minh Hong |
| Keywords: | combinatorial optimization, networks |
The close‐enough arc routing problem has an interesting real‐life application to routing for meter reading. In this article, we propose a new mathematical formulation for this problem. We analyze our formulation and compare it with two formulations in the literature. We also develop branch‐and‐cut algorithms to solve the problem to optimality. We present computational results for instances based on three types of graphs: directed, undirected, and mixed. Copyrigh.