In the Precedence Constrained Family Traveling Salesman Problem (PC-FTSP), there is a depot and a set of nodes that is partitioned into families. The traveling salesman must visit a predefined number of nodes in each family. Additionally, there are precedence relations between families that must be respected. There are travel costs associated with moving between nodes and the depot and nodes. The objective of the PC-FTSP is to determine a minimum-cost route that: (i) starts and ends at the depot; (ii) visits the required number of nodes from each, and (iii) satisfies the precedence relations.