The performance of the Alopex algorithm depends on the initial population distribution. The orthogonal design can generate more uniform distribution initial population. An orthogonal Alopex algorithm is presented based on the above two points. In order to overcome the premature convergence,the new algorithm incorporated the mutation operation. The results of numerical experimental and two engineering optimization design examples show that the proposed algorithm can overcome the premature convergence efficiently,and the results are better than the traditional optimization algorithm and the comparison algorithms.%针对Alopex算法对初值敏感的特性及正交设计可以使初始种群在空间分布更加均匀的特点,提出了正交Alopex算法.该算法为了克服后期“早熟”收敛的缺陷,引入了变异操作.数值仿真结果及两个工程优化问题的求解结果表明,所提出的算法能有效避免“早熟”收敛,且求解结果优于传统优化及比较算法.
展开▼