多目标优化
选择(遗传算法)
最优化问题
数学优化
计算机科学
进化算法
进化计算
优化测试函数
人工智能
机器学习
数学
多群优化
作者
Yiming Peng,Hisao Ishibuchi
标识
DOI:10.1109/tevc.2021.3117702
摘要
Multimodality is commonly seen in real-world multiobjective optimization problems (MOPs). In such optimization problems, namely, multimodal MOPs (MMOPs), multiple decision vectors can be projected to the same solution in the objective space (i.e., there are multiple implementations corresponding to that solution). Therefore, the diversity in the decision space is very important for the decision maker when tackling MMOPs. Subset selection methods have been widely used in the field of evolutionary multiobjective optimization for selecting well-distributed solutions (in the objective space) to be presented to the decision maker. However, since most subset selection methods do not consider the diversity of solutions in the decision space, they are not suitable for MMOPs. In this article, we aim to clearly demonstrate the usefulness of subset selection for multimodal multiobjective optimization. We propose a novel subset selection framework that can be easily integrated into existing multimodal multiobjective optimization algorithms. By selecting a prespecified number of solutions with good diversity in both the objective and decision spaces from all the examined solutions, the proposed framework significantly improves the performance of state-of-the-art multimodal multiobjective optimization algorithms on various test problems.
科研通智能强力驱动
Strongly Powered by AbleSci AI