A Tabu Search Heuristic for the Clustered Prize-Collecting Arc Routing Problem

The Clustered Prize-collecting Arc Routing Problem (CPARP) is an arc routing problem defined on an undirect graph. In the CPARP there is a cost function and a profit function on the edges. The profit function is applied only once when the edge is serviced. Also, there are clusters of required edges, and for each cluster, the problem requires that either all its edges are serviced or no edges of the cluster are serviced. The aim is to find the tour with maximum benefit. In this paper, we propose a Tabu Search Heuristic for the CPARP. The experimental results obtained, on the existent benchmark, show that the proposed Tabu Search Heuristic is competitive to the state-of-the-art methods.