一种改进的多目标变异算子

An Improved Mutation Scheme for Multi-objective Optimization Algorithm

设计了一种根据当前档案集非支配解的数量决定个体变异概率的二进制变异策略,使多目标进化算法能够具有较好的搜索性能,模拟实验验证了这种变异算子的有效性。

In this paper, we design a binary mutation scheme based on the current number of pareto solutions to decide the mutation probability. The binary mutation scheme makes the multi-objective optimization have better search funtion. The simulate experiment result proves that the mutation operation is effective.