The generalized arc routing problem

Abstract

This paper focuses on the generalized arc routing problem. This problem is stated on an undirected graph in which some clusters are defined as pairwise-disjoint connected subgraphs, and a route is sought that traverses at least one edge of each cluster. Broadly speaking, the generalized arc routing problem is the arc routing counterpart of the generalized traveling salesman problem, where the set of vertices of a given graph is partitioned into clusters and a route is sought that visits at least one vertex of each cluster. A mathematical programming formulation that exploits the structure of the problem and uses only binary variables is proposed. Facets and families of valid inequalities are presented for the polyhedron associated with the formulation and the corresponding separation problem studied. The numerical results of a series of computational experiments with an exact branch and cut algorithm are presented and analyzed.