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

PAGE I PAGE I 遗传算法求解旅行商问题研究 目录 TOC \o 1-3 \h \u 1 绪论 1 1.1研究背景 1 1.2 研究意义 1 1.3 国内外研究现状 1 2 理论背景 3 2.1 标准旅行商问题数学模型 3 2.2 遗传算法 4 2.2.1遗传算法思想起源 4 2.2.2遗传算法研究现状 4 2.2.3遗传算法的特点 4 2.2.4遗传算法的应用 5 2.3遗传算法分析 6 2.3.1解的表示 6 2.3.2编码方法 6 2.3.3交叉算子 6 2.3.4变异算子 7 2.3.5选择算子 7 2.3.6 遗传算法的运行参数选用 8 3 遗传算法求解旅行商问题的具体实现 9 3.1基本概念? 9 3.2算法流程图 10 3.3程序实现 10 3.4 数据分析 10 3.4.1 自定义30个城市坐标 10 3.4.2 假定城市数目为30，最大迭代次数为200 11 3.4.3 假定城市数目为50，最大迭代次数为200 11 3.4.4 假定城市数目为50，最大迭代次数为400 12 3.5结果分析 12 4 结论与展望 13 参考文献 14 PAGE 16 PAGE 16 【摘要】旅行商问题(Traveling Salesman Problem，TSP)是一个非常典型的组合优化问题，它计量的是一个推销员从初始城市出发，途径各个城市后，最终回到出发点，并且已知各个城市之间的距离相等。那么这个人应该怎么选择他的行进路线才能使总路程最短。正是由于这一问题在现实生活中多领域都有广泛的应用，国内外学者对其进行了大量研究。虽然这一问题有很多算法对其求解，但大多不直接，很复杂。本课题正是运用MATLAB进行编程，利用遗传算法对这一问题进行求解。用户可以自定义城市坐标或者输入城市数目随机产生城市坐标经过选择、交叉、变异运算后最终得到最优解。实验对比了不同情况，结果表明遗传算法对解决这一问题表现出了不错的效果。 【关键词】 旅行商问题 遗传算法 交叉算子 选择算子 变异算子 Traveling Salesman Problem Based on Genetic Algorithm 【Abstract】Traveling Salesman Problem (TSP) is a very typical combinatorial optimization problem. To put it simply, the traveling salesman problem can be explained as: a person has to pass through several cities and eventually return to the starting point, and the distance between the cities is known to be equal. So how should this person choose his route of travel to minimize the total distance. It is precisely because this problem has been widely used in many fields in real life that scholars at home and abroad have conducted extensive research on it. Although there are many algorithms to solve this problem, most of them are not direct and very complicated. This subject 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 city coordinates. The optimal solution is obtained through a series of operations such as selection, crossover, and mutation. Experimen