混合遗传算法在旅行商问题中的应用

为了更优地解决旅行商问题，改进单纯用遗传算法求解旅行商问题的结果，本文通过遗传算法和禁忌搜索算法自身的特点，分别对二者的优势和不足进行分析，提出一种将二者混合使用的求解旅行商问题的算法．该算法以遗传算法为基础，用遗传算法作全局搜索，用禁忌搜索算法作局部搜索．同时，通过计算实例分析，将这种混合遗传算法用于旅行商问题的求解中．试验表明，混合遗传算法比较单纯的遗传算法的计算结果有一定的改进．

A mixed genetic algorithm applied to TSP

In order to solve traveling saleman problem more satisfactorily,a mixed genetic algorithm is put forward in this paper.Genetic algorithm and tabu search algorithm are effective method to solve large-scale random target function optimizing problem.Both genetic algorithm and tabu search have advantages and disadvantages.On the basis of analyzing the characteristics of genetic algorithm and tabu search,a mixed method is founed.This mixed algorithm is based on genetic algorithm,using genetic algorithm for a large-scale search and tabu search for a local search to improve the calculation of genetic algorithm.At the same time,the algorithm is used in an example of traveling saleman problem.The calculation result indicates that the mixed algorithm genetic algorithm and tabu search is more effective than the single genetic algorithm.