摘要
通过分析正交阵列和遗传算法的特性,给出了正交阵列L4(23)的遗传算法的求解方案:确定编码的表示、选择算子、变异算子及适应度函数.实验表明,采用遗传算法求解L4(23)是可行的,有望求解更高阶的二元正交阵列,为正交阵列的求解问题提供了新的思路.
By analyzing the characteristics of orthogonal array and genetic algorithm, the orthogonal array scheme for solving problem by genetic algorithm was given, including determining encoding, selecting operator, mutation operator and fitness function. Tests showed that using genetic algorithms to solve the L4（2^3） is feasible, which is expected to solve higher-rder binary orthogonal arrays. The paper provides new ideas for orthogonal arrays to solve problems.
出处
《河南科学》
2012年第12期1742-1745,共4页
Henan Science
基金
河南省科技公关计划重点资助项目(12B520054)
关键词
正交阵列
遗传算法
适应度函数
orthogonal array
genetic algorithm
fitness function
