Solving the close-enough arc routing problem - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Networks Year : 2014

Solving the close-enough arc routing problem


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.

Dates and versions

hal-01105374 , version 1 (20-01-2015)



Minh Hoang Ha, Nathalie Bostel, André Langevin, Louis-Martin Rousseau. Solving the close-enough arc routing problem. Networks, 2014, 63 (1), pp.107-118. ⟨10.1002/net.21525⟩. ⟨hal-01105374⟩
123 View
0 Download



Gmail Facebook X LinkedIn More