Given a set of depots D and a set of nodes partioned into families, the multi-depot family traveling salesman problem (MDFTSP) consists of estabilishing the minimum cost set of |D| routes that visits a given number of nodes per family and each route contains one, and only one, depot.