Abstract The multiple Traveling Salesmen Problem (m TSP) is a general extension of the
famous NP-hard Traveling Salesmen Problem (TSP), that there are m (m> 1) salesmen to …

The path planning of an autonomous surface vehicle in a lake for environmental monitoring
has been modeled as a constrained case of the traveling salesman problem, in which the …

The optimization of logistics distribution can be defined as the multiple traveling salesman
problem (MTSP). The purpose of existing heuristic algorithms, such as Genetic Algorithm …

In this paper, a two-phase ant colony optimization (ACO) based approach has been
presented to solve a single depot multiple travelling salesmen problem (mTSP) in Type-2 …

To address the critical problems of high fuel consumption and severe traffic congestion of
brought by blindly cruising in a vast transportation system, we propose a Bidirectional-A-star …

Multiple traveling salesperson problems (m TSP) are a collection of problems that
generalize the classical traveling salesperson problem (TSP). In a nutshell, an m TSP …

In view of the difficulties of fruit cluster identification, the specific harvesting sequence
constraints of aggregated fruits, and the balanced harvesting task assignment for the …

In the technological development era, the solution to various complex problems is uncertain,
and more attention should be paid for changing certain conditions. Therefore, a precise …

The travelling salesman problem (TSP) and its variants have been studied extensively due
to its wide range of real-world applications, yet there are challenges in providing efficient …

The multiple travelling salesmen problem (MTSP), which includes m salesmen starting and
ending their tours at a same fixed node (m> 1), is an extension of travelling salesman …