求解TSP的子空间遗传算法

SUBSPACE GENETCI ALGORITHM FOR TSP

为避免遗传算法在计算过程中搜索冗余空间而耗费不必要的资源及时间 ,本文提出了一种以经典遗传算法为基础 ,通过分析问题的特殊解集 ,以找出原问题解空间的区域特征从而构造出缩小算法搜索空间的子空间遗传算法 ,并用它求解 TSP.结果表明 。

In this paper,based on classic genetic algorithm,a kind of subspace genetic algorithm is presented to avoid searching abundant space and reduce the use of computer resource and time when solving problem with genetic alogrithm,which is to construct a algorithm with smaller searching space through analyzing solution to some special instances of the problem and finding out the region characteristic of the solution.As is used to solve the TSP,it is testified efficient.