The Multiple Traveling Salesman Problem (MTSP) is considered as an NP-complete problem due to the difficulty of finding shortest tour between different cities with a set constraints such visiting each city once by one salesman. solution represents sum all tours' costs performed n salesmen. In this research, we propose novel approach find solutions for various instances MTSP based on memetic alg...

The multiple Traveling Salesman Problem (mTSP) is a complex combinatorial optimization problem, which is a generalization of the well-known Traveling Salesman Problem (TSP), where one or more salesmen can be used in the solution. The optimization task can be described as follows: given a fleet of vehicles, a common depot and several requests by the customers, find the set of routes with overall...

the multiple traveling salesman problem (mtsp) involves scheduling m > 1 salesmen to visit a set of n > m nodes so that each node is visited exactly once. the objective is to minimize the total distance traveled by all the salesmen. the mtsp is an example of combinatorial optimization problems, and has a multiplicity of applications, mostly in the areas of routing and scheduling. in this paper,...

MinMax Multiple Travelling Salesman Problem (mTSP) is an important class of combinatorial optimization problems with many practical applications, which the goal to minimize longest tour all vehicles. Due its high computational complexity, existing methods for solving this problem cannot obtain a solution satisfactory quality fast speed, especially when scale large. In paper, we propose learning...

The multiple Travelling Salesman Problem (mTSP) is the general form of TSP, in which one or more than one salesmen can be used in the solution set. The Constraint in the optimization task is that each salesman returns to starting point at end of trip, travelling to a specific set of cities in between and except for the first one, each and every city is visited by exactly one salesman. The idea ...

This article presents a new modified version of the ant colony optimization (ACO) mixed with insert, swap and 2-opt algorithm called NMACO for solving the multiple traveling salesman problem (MTSP) which utilizes an effective criterion for escaping from the local optimum points. The MTSP is one of the most important combinatorial optimization problems in which the objective is to minimize the d...

Abstract The multiple traveling salesman problem (MTSP) is an extension of the (TSP). It found that MTSP on a three-dimensional sphere has more research value. In spherical space, each city located surface Earth. To solve this problem, integer-serialized coding and decoding scheme was adopted, artificial electric field algorithm (AEFA) mixed with greedy strategy state transition strategy, based...

The Travelling Salesman Problem (TSP) is a well-known combinatorial optimization problem that belongs to class of problems known as NP-hard, which an exceptional case travelling salesman (TSP), determines set routes enabling multiple salesmen start at and return home cities (depots). penguins search algorithm (PeSOA) new metaheuristic algorithm. In this paper, we present discrete for solving th...

A new algorithm based on the ant colony optimization (ACO) method for multiple traveling salesman problem (mTSP) is presented and defined as ACO-BmTSP. This paper addresses of solving mTSP while considering several salesmen keeping both total travel cost at minimum tours balanced. Eleven different problems with variants were analyzed to validate method. The 20 considered three twenty regarding ...

This paper presents a wide-range routing method for multiple rovers deployed lunar polar exploration mission. In the mission scenario considered in this paper, points are divided into several sets of to be assigned rovers. Subsequently, routes between generated each rover. assignment and problems well known as Traveling Salesman Problem (mTSP). The aims minimize two objective functions: sum sta...