The family traveling salesman problem with incompatibility constraints (FTSP-IC) arises by introducing incompatibilities among families, that is, there are pairs of incompatible families and nodes from incompatible families cannot be visited in the same route. Therefore, a feasible solution for the FTSP-IC consists of a set of routes that: begins and ends at the depot, visits the required number of nodes per family and satisfies the condition that nodes from incompatible families cannot be visited in the same routes.