The FTSP may be modeled using a complete and directed graph G = ({0} U N, A), where 0 represents the depot and N is the set of nodes that is partitioned into the several families. There are L disjoint families and each family l contains nl nodes. The number of nodes that we are required to visit in family l is vl and the total number of visits is V.