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 a...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Networks 2014-01, Vol.63 (1), p.107-118
Hauptverfasser:	Hà, Minh Hoàng, Bostel, Nathalie, Langevin, André, Rousseau, Louis-Martin
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Applied sciences automated meter reading branch-and-cut algorithm close-enough arc routing problem close-enough traveling salesman problem Computer Science Computer science control theory systems Exact sciences and technology Flows in networks. Combinatorial problems Information retrieval. Graph Logistics Operational research and scientific management Operational research. Management science Operations Research radio frequency identification Radiocommunications Telecommunications Telecommunications and information theory Theoretical computing
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	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. Copyright © 2013 Wiley Periodicals, Inc. NETWORKS, Vol. 63(1), 107–118 2014
ISSN:	0028-3045 1097-0037
DOI:	10.1002/net.21525