The MTSP problem solving based on GA
Zhang Ya-hon · Microcomputer Information · 2010
The Multiple Traveling Salesperson Problem is to discuss how m salespersons to visit a set of n locations,each of them is visited exactly only once while minimizing the total distance traveled by the salesperson.This paper analyzes the feature of MTSP,based on the basic idea of Genetic Algorithm,which selects the reasonable coding and genetic operators.The experimental results show that we can obtain a good solution from this method.