[HTML][HTML] A survey on the Traveling Salesman Problem and its variants in a warehousing context
With the advent of e-commerce and its fast-delivery expectations, efficiently routing pickers
in warehouses and distribution centers has received renewed interest. The processes and …
in warehouses and distribution centers has received renewed interest. The processes and …
A Branch-and-Cut algorithm for the dial-a-ride problem with incompatible customer types
A Schulz, C Pfeiffer - Transportation Research Part E: Logistics and …, 2024 - Elsevier
Ridepooling is expected to become more and more important in people's mobility. At the
same time, autonomous vehicles are expected to be widely used in such applications in the …
same time, autonomous vehicles are expected to be widely used in such applications in the …
[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 …
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 …
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 multi‐depot family traveling salesman problem and clustered variants: Mathematical formulations and branch‐&‐cut based methods
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 …
two clustered variants, the soft‐clustered MDFTSP (SC‐MDFTSP) and the hard‐clustered …
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 …
An intensification-driven search algorithm for the family traveling salesman problem with incompatibility constraints
The family traveling salesman problem with incompatibility constraints (FTSP-IC) is a variant
of the well-known traveling salesman problem. Given a set of candidate nodes divided into …
of the well-known traveling salesman problem. Given a set of candidate nodes divided into …
Solution of the family traveling salesman problem using a hyper-heuristic approach
This article is concerned with a recently introduced variant of the generalized traveling
salesman problem (GTSP) called the family traveling salesman problem (FTSP). Given a set …
salesman problem (GTSP) called the family traveling salesman problem (FTSP). Given a set …