An ALNS metaheuristic for the family multiple traveling salesman problem
CB Cunha, DF Massarotto, SL Fornazza… - Computers & Operations …, 2024 - Elsevier
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 …
well-known NP-hard problem introduced by Morán-Mirabal et al.(2014). In the FTSP, the set …
[HTML][HTML] The family capacitated vehicle routing problem
R Bernardino, A Paias - European Journal of Operational Research, 2024 - Elsevier
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 …
hard problem that generalizes both the FTSP and the capacitated vehicle routing problem …
A parallel branch-and-cut and an adaptive metaheuristic to solve the Family Traveling Salesman Problem
AA Chaves, BL Vianna, TT da Silva… - Expert Systems with …, 2024 - Elsevier
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 …
Traveling Salesman Problem that group nodes into families. The goal is to select the best …
The capacitated family traveling salesperson problem
S Domínguez‐Casasola… - International …, 2024 - Wiley Online Library
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 …
nodes are partitioned into disjoint and differently weighted families. The objective is to find …
A matheuristic approach for the family traveling salesman problem
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 …
into a number of clusters called families. The salesman has to find a shortest possible tour …
A Branch-and-Cut algorithm for the multiple Steiner TSP with order constraints
R Taktak - Annals of Operations Research, 2024 - Springer
This paper deals with a variant of the traveling salesman problem (TSP), called the multiple
Steiner TSP with order constraints. This consists, given an undirected graph with …
Steiner TSP with order constraints. This consists, given an undirected graph with …