This paper proposes a hybrid genetic algorithm for solving the Multiple Traveling Salesman
Problem (mTSP) to minimize the length of the longest tour. The genetic algorithm utilizes a …

The minmax multiple traveling salesman problem with single depot (the minmax mTSP) or
multiple depots (the minmax multidepot mTSP) aims to minimize the longest tour among a …

The traveling salesman problem is a classic combinatorial optimization challenge with
profound implications for various industries. While significant progress has been made in …

We propose a new method called the Reinforced Hybrid Genetic Algorithm (RHGA) for
solving the famous NP-hard Traveling Salesman Problem (TSP). Specifically, we combine …

Multiple traveling salesmen problem (MTSP) is an extension of traditional traveling
salesman problem (TSP). It involves both the city assignment optimization and the route …

The traveling salesman problem is a well-known combinatorial optimization problem.
Solving the traveling salesman problem efficiently becomes more challenging when …

Effective scheduling of multiple agricultural machines in emergencies can reduce crop
losses to a great extent. In this paper, cooperative scheduling based on deep reinforcement …

This paper addresses a MinMax variant of the Dubins multiple traveling salesman problem
(mTSP). This routing problem arises naturally in mission planning applications involving …

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 response to the COVID-19 pandemic, communities utilize unmanned vehicles to minimize
person-to-person contact and lower the risk of infection. This paper addresses the critical …