Multiple traveling salesmen problem (MTSP) is not only a generalization of the traveling
salesman problem (TSP), but also more suitable for modeling practical problems in the real …

In this study, we consider the multiple traveling salesman problem (MTSP) with multiple
depots, closed paths, and a constraint on the number of cities visited by each traveling …

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 …

We consider the multiple traveling salesman problem on a weighted tree. In this problem
there are m salesmen located at the root initially. Each of them will visit a subset of vertices …

We develop a general framework for designing polynomial-time approximation schemes
(PTASs) for various vehicle routing problems in trees. In these problems, the goal is to …

In this paper, we examine a vehicle routing problem with a makespan objective
incorporating both stochastic and correlated travel times, which is usually not considered in …

In the past decade Unmanned Vehicles have become a topic of interest in many research
organizations. Unmanned vehicles based systems are integrated to many applications in …

This paper presents a new method based on Equilibrium Optimizer (EO) algorithm that is
inspired from the mass balance of a control volume for traveling salesman problem (TSP) …

Abstract The Capacitated Vehicle Routing Problem (CVRP) is an optimization problem that
involves arranging vehicle routes while considering vehicle capacity. This research aims to …

ABSTRACT The Multiple Travelling Salesman Problems (MTSP) can be used in a wide
range of discrete optimization problems. As the solution to this problem has wide …