求解L8（2^7）的突变策略

Mutation Strategy for Solving the Problems of Orthogonal Array L8 （2^7）

通过分析求解正交阵列问题的遗传算法的不成功算例,给出了求解正交阵列的突变策略,结合选择策略、变异策略,形成了改进的遗传算法.实验表明,采用改进后的遗传算法,求解L8(27)是可行的,希望该算法经过进一步发展后能快速地构造出更多的正交阵列.

Through the unsuccessful example using genetic algorithm for solving problems of orthogonal array, we give the mutation strategy for solving the orthogonal array. Combined with the selection strategy, mutation strategy, an improved genetic algorithm was formed. Experiments show that, by using the improved genetic algorithm, solving the L8 （2^7） is feasible. The algorithm after further development can quickly construct orthogonal array more.