IEEE Trans Cybern. 2014 Mar;44(3):378-93. doi: 10.1109/TCYB.2013.2256418. Epub 2013 May 27.
Many multi-objective evolutionary algorithms (MOEAs) have been successful in approximating the Pareto Front. However, well-distributed solutions in the objective and decision spaces are still required in many real-life applications. In this paper, a novel MOEA is proposed to this problem. Distinct from other MOEAs, the proposed algorithm suggests a framework, which includes two crowding estimation methods, multiple selection methods for mating and search strategies for variation, to improve the MOEA' s searching ability, and the diversity of its solutions. The algorithm emphasizes the importance of using the decision space and the objective space diversities. The objective space crowding and decision space crowding distances are designed using different ideas. To produce new individuals, three different types of mating selections and their respective search strategies are constructed for the main population and the two sparse populations, with the help of the two crowding measurements. Finally, based on the experimental tests on 17 unconstrained multi-objective optimization problems, the proposed algorithm is demonstrated to have better results compared to several state-of-the-art MOEAs. A detailed analysis on the effectiveness and robustness of the framework is also presented.
许多多目标进化算法(MOEAs)在逼近 Pareto 前沿方面取得了成功。然而,在许多实际应用中仍然需要在目标和决策空间中具有良好分布的解决方案。本文针对该问题提出了一种新的 MOEA。与其他 MOEAs 不同,所提出的算法提出了一个框架,该框架包括两种拥挤估计方法、用于交配的多种选择方法以及用于变异的搜索策略,以提高 MOEA 的搜索能力和解决方案的多样性。该算法强调了使用决策空间和目标空间多样性的重要性。目标空间拥挤距离和决策空间拥挤距离的设计采用了不同的思路。为了产生新的个体,利用两种拥挤度量方法,为主要种群和两个稀疏种群构建了三种不同类型的交配选择及其各自的搜索策略。最后,通过对 17 个无约束多目标优化问题的实验测试,与几个最先进的 MOEAs 相比,所提出的算法显示出更好的结果。还对框架的有效性和鲁棒性进行了详细分析。