提出一种用于求解约束多目标优化问题的新算法,其主要特点是将约束条件转化为一个目标,并引入免疫克隆和免疫记忆机制,使抗体种群的演化过程和记忆单元的演化过程并行进行,更好地实现了抗体间的相互协作,保证了在演化过程中,解集从可行域内部和不可行域边缘向着约束最优Pareto-前端逼近.从而保证了算法较强的收敛性以及所得最优解较好的多样性.仿真结果表明,新算法很好的保持了所得最优解的多样性、均匀性以及较强的收敛性.
A new algorithm for constrained multi-objective optimization is presented. The algorithm treats the constraints as an objective and the immune clone and immune memory mechanism are introduced. Therefore, the new algorithm could find the Pareto-optimal solutions from the feasible region and the edge of the infeasible region, which assures both the convergence and diversity of the obtained solutions. Simulation results show that the new algorithm has much better performance in finding a much better spread of solutions, in maintaining a better uniformity of the solutions and in obtaining a better convergence.