combinatorial optimization problem where, given an undirected graph, the objective is to find
a minimum cost set of tours servicing a subset of required edges under vehicle capacity
constraints. There are numerous applications for the CARP, such as street sweeping,
garbage collection, mail delivery, school bus routing, and meter reading. A Greedy
Randomized Adaptive Search Procedure (GRASP) with Path-Relinking (PR) is proposed …