遗传算法求解旅行商问题研究

Traveling Salesman Problem Based on Genetic AlgorithmMajor AutomationStudents Zhou Aiyan Tutor Xu Wen[Abstract Traveling Salesman Problem (TSP)is a very typical combinatorial optimizationproblem.To put it simply,the traveling salesman problem can be explained as:a person has topass through several cities and eventually return to the starting point,and the distance betweenthe cities is known to be equal.So how should this person choose his route of travel to minimizethe total distance.It is precisely because this problem has been widely used in many fields in reallife that scholars at home and abroad have conducted extensive research on it.Although there aremany algorithms to solve this problem,most of them are not direct and very complicated.Thissubject is to use MATLAB for programming,and use genetic algorithm to solve this problem.The user can customize city coordinates or enter the number of cities to randomly generate citycoordinates.The optimal solution is obtained through a series of operations such as selection,crossover,and mutation.Experiments in this paper operate in different situations,and we can seethat genetic algorithms have a significant effect in solving these problems.[Keywords traveling salesman problem genetic algorithm crossover operator Selectionoperator Mutation operator