遗传算法的隐形二进制编码法

The implicit binary coding method of genetic algorithm

1. 海洋石油勘探开发研究中心,高碑店 074101;2. 长春科技大学,长春 074010

Research Cener of Offshore Oil Exploration and Development, CNOOC, Gaobeidian 074010

遗传算法常规二进制编码在求解高维最优化问题时, 因模型参数量太大会使其二进制码占用巨大的内存, 并需进行大量的译码工作, 甚至有可能出现影响遗传算法实现的问题。为此, 我们提出了一种实用有效的隐形二进制优化编码方案。当遗传算法应用于高维反演问题时, 这种编码方法不仅能将参数占用的内存减少到最低的限度, 而且同常规的二进制编码法相比, 还能几倍地减少参数译码的计算工作量。

In solving high-dimensional optimization problems, the conventional binary nding of genetic algorithm may occupy huge computer memories, need a large amount of decoding work, and evenaffect the implementation of genetic algorithm since the model parameter amount is considerably large.In light of these problmes, this paper presents a practical, efficient implidt binary coding scheme. Whenapplial to high-dimensional inverse problems, this coding method can not only reduce the memories occupied by parameters to the minimum, but also decrease the decoding work amount by a big margin.