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.
Type de document :
Article dans une revue
Networks, Wiley, 2014, 63 (1), pp.107-118. 〈10.1002/net.21525〉
Liste complète des métadonnées

https://hal.inria.fr/hal-01105374
Contributeur : Nathalie Bostel <>
Soumis le : mardi 20 janvier 2015 - 11:20:30
Dernière modification le : mercredi 16 mai 2018 - 11:48:03

Lien texte intégral

Identifiants

Collections

Citation

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〉

Partager

Métriques

Consultations de la notice

230