毕业设计论文-遗传算法求解TSP问题的计算机仿真.docVIP

题目：  遗传算法求解的计算机仿真 由于遗传算法在整体搜索策略和优化搜索方法不依赖梯度信息或其他辅助，影响搜索方向的目标函数和相应的适应度函数，求解复杂系统通用框架遗传算法广泛应用于数学问题、组合优化、机械设计、智能等领域。 算法（）自然界生物选择和进化机制而发展起来的一种高度并行、随机算法。特别于求解传统的搜索算法不好的最优解问题问题（raveling Salesman Problem）要决定一条经过所且仅当一次且距离最短的路线，即距离最短的amilton回路。问题是一个具有十分广泛的背景重要理论的组合优化问题本文用遗传算法城市Grefenstette等提出一种巡回路线编码方法算采用了常规的法通过组实验和数据求解城市的最优解，了计算机仿真求解。 问题遗传算法算法；编码 The computer simulation of genetic algorithm to solve TSP problem Abstract Due to genetic algorithm on the overall search strategy and optimization search method does not depend on the gradient information or other auxiliary knowledge, only need to influence the search direction of the objective function and the corresponding fitness function, and so provides a generic framework for solving complicated system problem, so the genetic algorithm is widely used in mathematical problem, combinatorial optimization, mechanical design, artificial intelligence, etc Genetic algorithm (based Algorithms, the GA) is mimic natural biological natural selection and evolution mechanism and developed a kind of highly parallel, adaptive random search algorithm. Particularly suitable for solving the traditional search algorithm is not good to deal with complex optimal solution of problem. Traveling Salesman Problem (ll Salesman Problem) is to determine a through route if and only if all cities in time and distance is the shortest route, the shortest distance of Hamilton loop. Traveling salesman problem is a very wide range of practical background and important theoretical value of the combinatorial optimization problem. At present the main method of solving TSP problem with simulated annealing algorithm, genetic algorithm and Hopfield neural network algorithm, the heuristic search method, the binary tree described algorithm. This article chooses 45 cities genetic algorithm to solve the TSP problem, based on Microsoft Visual c + + environment, use the proposed a new tour routes such as Grefenstette coding method, mutation operator adopted convention