Operators of the Two-Part Encoding Genetic Algorithm in Solving the Multiple Traveling Salesmen Problem

The multiple traveling salesmen problem (mTSP) considers the m salesmen to visit n cities. This problem involves the assignment of the salesmen to some locations and we have to optimize the sequence within the route, so it is even harder than the traveling salesman problem (TSP) in nature. As a result, there are some algorithms used to solve the mTSP when the problem size is large. Particularly, genetic algorithm (GA) is quite famous in solving this problem while the problem size is large. When we compare the major existing encoding methods for mTSP, the best approach could be the two-part chromosome encoding due to its solution space is the smallest. The two parts are responsible for the sequence and the number of cities should be visited by each salesman. However, because the two-part chromosome technique is the recently proposed encoding method, the better combination of the crossover operators and mutation operators have not studied for this encoding method. As a result, this paper investigates the genetic operators could be used for this purpose by design-of-experiments (DOE). The appropriate genetic operators are suggested in this paper and it could be used to applied in the GA which employs the two-part chromosome encoding technique.補正完