0-1编码遗传算法

The genetic algorithm using 0-1 code

本文分析了常规二进制编码遗传算法中二进制编码方法的特点,总结出二进制编码方法存在占用内存多、实现不灵活和译码运算量相对大的缺点,使较大规模的多参数优化问题难于用二进制编码遗传算法在较小内存的计算机上实现。为了克服二进制编码方法的这一缺点,我们提出一种0-1编码方法。文中介绍了0-1编码的方法和特点,并从定义的图式概念出发,证明了0-1编码遗传算法的收敛性。实际算例也表明,0-1编码遗传算法是可行的。

In this paper,the feature of the binary code method in the conventional binary code genetic algorithm is analyzed, It is concluded that the binary code method has disadvantages of occupying much memory space,implementing not flexibly,and roquiring largc amount for decoding calculation- Thcrefore,the optimization problem of the relative large-scale mutiparameter is difficult to realize on the computer wit smaller memory space using the binary code genetic algorithm. In order to overcome the disadvantages,we put forward a 0-1 code method. The features of the method are introduced. We also verify the convergence of the 0-1 code genetic algorithm according to the defined concept of schemata. A real calculated example shows that the 0-1' code genetic algorithm is feasible.