Instances for the "Exact and Matheuristic Approaches for the Capacitated Family Traveling Salesman Problem" article

The Capacitated Family Search Traveling Salesperson Problem (CFTSP) is a variant of the Family Traveling Salesperson Problem. The CFTSP is modeled by a graph in which its nodes are classified into disjoint families. The problem is to visit a given quantity of nodes of each family using a set of capacitated agents to minimize the total traveled distance. To address this problem, we propose an exact method based on a constraint programming model and a matheuristic based on a reactive Greedy Randomized Adaptive Search Procedure with probabilistic stop criteria to solve larger instances in a reasonable time. The Experimental results obtained by exact and non-exact methods are presented and compared.