The Family Traveling Salesperson Problem (FTSP) is a variant of the widely known Traveling Salesperson Problem (TSP) in which the set of nodes is subdivided into disjoint node families. The FTSP seeks for the shortest tour with a predetermined number of visits per node family. The objective of this thesis is to conduct a systematic literature review on the FTSP by analyzing different problem variants, their applications and solution procedures which exist in literature.

Interested in this topic? Please read about the application procedure on our website!