In the Family Capacitated Vehicle Routing Problem (F-CVRP) a fleet of fixed-capacity homogenous vehicles must find the lowest-cost set of routes starting and ending at a central depot. There are several clients grouped into distinct families. Instead of visiting every single client, the problem requires visiting a specific number of clients within each family. Furthermore, every client belonging to a particular family shares an identical demand. Ultimately, the objective is to determine the most cost-effective routing plan that successfully fulfills the required number of visits per family while ensuring that the cumulative demand satisfied on any single route never exceeds the vehicle’s maximum capacity.