The generalized traveling salesman problem (GTSP) is an extension of the classical
traveling salesman problem (TSP) and it is among the most researched combinatorial …

The clustered generalized traveling salesman problem (CGTSP) is an extension of the
classical traveling salesman problem (TSP), where the set of nodes is divided into clusters of …

This study focuses on the collaborative multicenter vehicle routing problem with time
windows and mixed deliveries and pickups (CMVRPTWMDP), which is a variant of the …

With the rapid development of tourism in the economy, popular demand for tourism also
increases. Unreasonable distribution arises a series of problems such as reduction of tourist …

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 …

The development of e-commerce has led to a surge in the number of online shopping
parcels. However, given the lack of scale effect, last mile delivery is inefficient, expensive …

The combination of objectives to be optimized is known as Combinatorial Optimization.
Traveling Salesman is one of the demanding topics in the field of Combinatorial …

Abstract In the classical Traveling Salesman Problem, the order in which the vertices are
visited has no restrictions. The only condition imposed is that each vertex is visited only …

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 …

This paper proposes a novel matheuristic algorithm for the Set Orienteering Problem (SOP).
The set orienteering problem generalizes the Orienteering Problem (OP) by considering …