A hybrid metaheuristic for the family capacitated vehicle routing problem
The Family Traveling Salesman Problem (FTSP) seeks a minimum-cost tour from a depot that visits a prescribed number of members of each customer family. This paper studies the Family Capacitated Vehicle Routing Problem (F-CVRP), a generalization of the FTSP in which customers carry demands and are served by a homogeneou...