Service interruption on Monday 11 July from 12:30 to 13:00: all the sites of the CCSD (HAL, Epiciences, SciencesConf, AureHAL) will be inaccessible (network hardware connection).
Skip to Main content Skip to Navigation
Journal articles

Solving the close-enough arc routing problem

Abstract : 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.
Document type :
Journal articles
Complete list of metadata
Contributor : Nathalie Bostel Connect in order to contact the contributor
Submitted on : Tuesday, January 20, 2015 - 11:20:30 AM
Last modification on : Wednesday, April 27, 2022 - 3:50:02 AM

Links full text




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



Record views