【摘要】 针对排列问题的编码方法一直是遗传算法应用中的重要研究领域。采用各种传统编码方法的编码表示空间通常远远大于实际的问题空间,这不但提高了各算子设计的复杂性,同时很大程度上降低了收敛速度。文章提出了一种针对排列问题基于次序的一维二进制编码方案和两种改良方案,使排列与编码形成了一一映射,最大限度地缩小了编码表示空间与问题空间的差距。采用TSP问题的实验结果表明,文章提出的编码方式具有很好的性能。更多还原

【Abstract】 Encoding of genetic algorithm(GA)about array problem is an important problem in GA’s application.The size of representation space by using traditionary encoding schemes is far great than the size of problem space,which not only increase complexity of genetic operators but also expend generations much more.A kind of new one dimension bi-nary encoding scheme and its two improved encoding schemes based on order of array are presented for solving the array problem,using in such as Traveling Salesman Problem(TSP)or Scheduling Problem et.The difference size between of representation space and problem space is reduced.The new encoding schemes accelerate search process in problem space by reducing encoding space.The experimental results show that the new encoding scheme has great advantage of speed over other encoding schemes.更多还原