The Family Traveling Salesperson Problem (FTSP) is a variant of the Traveling Salesperson
Problem (TSP), in which all vertices are divided into several different families, and the goal …

This paper presents a novel variant of the Family Traveling Salesman Problem (FTSP), a
well-known NP-hard problem introduced by Morán-Mirabal et al.(2014). In the FTSP, the set …

In this study, we propose a mathematical model of a 4D clustered traveling salesman
problem (CTSP) to address the cost-effective security and risk-related difficulties associated …

In this article, we address the family capacitated vehicle routing problem (F-CVRP), an NP-
hard problem that generalizes both the FTSP and the capacitated vehicle routing problem …

The Ant Colony Optimization (ACO) is easy to fall into the local optimum and its convergence
speed is slow in solving the Travelling Salesman Problem (TSP). Therefore, a Slime Mold …

This paper addresses the Family Traveling Salesman Problem (FTSP), a variant of the
Traveling Salesman Problem that group nodes into families. The goal is to select the best …

The capacitated family traveling salesperson problem (CFTSP) is about a graph in which
nodes are partitioned into disjoint and differently weighted families. The objective is to find …

In the family traveling salesman problem (FTSP), there is a set of cities which are divided
into a number of clusters called families. The salesman has to find a shortest possible tour …

In this article, we study the multi‐depot family traveling salesman problem (MDFTSP) and
two clustered variants, the soft‐clustered MDFTSP (SC‐MDFTSP) and the hard‐clustered …

This paper addresses the double traveling salesman problem with partial last‐in‐first‐out
(LIFO) loading constraints. A vehicle picks up items in the pickup area and loads them into …