基于遗传算法的旅行商问题仿真实现

Application Research of Genetic Algorithm in the Traveling Salesman Problem

从应用的角度讨论了基于遗传算法的旅行商问题 (TravellingSalesmanProblem ,简称TSP)的求解方法 ,在应用遗传算法求解旅行商问题时 ,参数值的不同设定对解有不同的影响 ,结合旅行商问题具体实例 ,对参数值的变化进行了观察 ,当选择 pc=0 5 ,pm=0 0 0 1时 ,得到了较为理想的最短旅行路径。

The working method of travelling salesman problem based on genetic algorithm is given in application. Different parameter enactment can affect radix in working radix. Combing the practical example, it observes the changing of parameters, when p c equals to 0\^5, p m equals to 0\^01, the ideal shortest travelling route is obtained.