基于均匀设计的遗传算法求解旅行商问题【毕业论文】.docVIP

本科毕业论文 （20 届） 基于均匀设计的遗传算法求解旅行商问题 专业：计算机科学与技术 摘 要 旅行商问题（TSP）是古老的NP问题，目前的求解方法主要有：启发式算法、遗传算法、模拟退火算法、蚁群算法等。遗传算法是由美国密执安大学的Holland教授提出的，它通过模拟生物在自然环境中的遗传和进化过程来优化复杂问题的自适应算法。遗传算法对问题的种类具有很强的鲁棒性，因此广泛应用于很多领域，例如：自动控制、机器人学、图象处理、人工生命Genetic Algorithm to Solve the Traveling Salesman Problem Based on Uniform Design Abstract Traveling salesman problem(TSP) is an old NP problem, the present solution methods are: heuristic algorithm, genetic algorithms, simulated annealing, ant colony algorithm. Genetic algorithm is put forward by Professor Holland in Michigan University, which made ??it through the simulation of the natural environment, bio-genetic and evolutionary processes to optimize the complex problem of adaptive algorithm. The type of genetic algorithm to the problem has strong robustness, it is widely used in many fields, such as: automatic control, robotics, image processing, artificial life and so on. However, in the classical genetic algorithm is needed for parameter setting, and setting these parameters which are very large, often needs to rely on experience and test to determine the workload. And it is difficult to obtain the optimal combination of parameters that affect the algorithm Performance, so how to set the parameters of study is of important theoretical and practical significance. This thesis tries to solve the traveling salesman problem by using uniform design of genetic algorithm. On the one hand, the traveling salesman problem itself is a typical practical problem that requires encoding method to be solved, which fits the characteristics of the genetic algorithm. On the other hand, genetic algorithms, the need for some basic operating parameters (such as: population size, crossover probability, mutation probability, etc.) to set the level .when the number of parameters increases, the number of tests also increased significantly, affecting Algorithm using. Therefore, the uniform design can be quickly with less test set out the values ??of algorithm parameter