Theoretical and computational analysis of a new formulation for the Rural Postman Problem and the General Routing Problem

Abstract

The Rural Postman Problem (RPP) is one of the most well-known problems in arc routing. Given an undirected graph, the RPP consists of finding a closed walk traversing and servicing a given subset of edges with minimum total cost. In the General Routing Problem (GRP), there is also a subset of vertices that must be visited. Both problems were introduced by Orloff and proved to be NP-hard. In this paper, we propose a new formulation for the RPP and the GRP using two sets of binary variables representing the first and second traversal, respectively, of each edge. We present several families of valid inequalities that induce facets of the polyhedron of solutions under mild conditions. Using this formulation and these families of inequalities, we propose a branch-and-cut algorithm, test it on a large set of benchmark instances, and compare its performance against the exact procedure that, as far as we know, produced the best results. The results obtained show that the proposed formulation is useful for solving undirected RPP and GRP instances of very large size.