This paper presents a new local search operator with the Bees Algorithm (BA) to solve the
Multiple Traveling Salesman Problem (MTSP), which is a kind of combinatorial optimization …

The Multiple Traveling Salesmen Problem (mTSP) is of the famous and classical problems
of research in operations and is accounted as one of the most famous and widely used …

Multiple traveling salesman problem (MTSP) is a generalization of the classic traveling
salesman problem (TSP). Compared to TSP, MTSP is more common in real-life applications …

The Multiple Traveling Salesman Problem (MTSP) is the extension of the Traveling
Salesman Problem (TSP) in which the shortest routes of m salesmen all of which start and …

Abstract Multiple Traveling Salesman Problem (MTSP) is able to model and solve various
real-life applications such as multiple scheduling, multiple vehicle routing and multiple path …

The multiple traveling salesman problem (MTSP) is a generalization of the famous traveling
salesman problem (TSP), where more than one salesman is used in the solution. Although …

We present an effective hybrid algorithm with neighborhood reduction for solving the
multiple traveling salesman problem (mTSP). This problem aims to optimize one of the two …

Combinatorial optimization finds the best subset in a discrete problem space. In engineering
or management fields, many problems are formulated as a combinatorial optimization …

Problem (MTSP) that is one of the generalization of the travelling salesman problem (TSP).
For solving this problem genetic algorithms (GAs) based on numerous crossover operators …

Travelling salesman problem (TSP) is a fundamental combinatorial optimization model
studied in the operations research community for nearly half a century. It belongs to the class …