arrow
返回

Differential evolution with nearest better clustering for multimodal multiobjective optimization

delete2023-11-01
delete2
PRE
AI
A
Aruna Tiwari
DOI:10.1016/j.asoc.2023.110852delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
The main aim of multimodal multiobjective optimization algorithms is to find multiple optimal solutions for multiple objectives. The problem with multiple objectives is to maintain the diversity and convergence balance in both decision and objective space. Better performance in one space can lead to deterioration of performance in another space. To effectively perform exploration and exploitation in the decision space, we have proposed a niching technique in our proposed algorithm based on differential evolution to form groups of the population. The niching technique also incorporates a balancing strategy to average the size of niches and a generation strategy to add new elements by finding promising areas. We have also proposed an archive strategy to store the possible optimal solutions that help to explore the decision space and ensure diversity as well as the convergence of the solutions. To show the efficiency of our proposed algorithm, we have performed exhaustive experimentation on the benchmark test suite and compared the results with state-of-the-art algorithms. The experimental results obtained using the proposed algorithm highlight the efficiency and effectiveness of our proposed algorithm in both decision and objective space.
Keyword:
Multimodal multiobjective optimization
Differential evolution
Balanced nearest better clustering
Adaptive generation strategy
Archival strategy

期刊

Applied Soft Computing 封面图
Applied Soft Computing
IF:
6.6
论文数:
1.4W
被引数:
4.8W

机构

I
indian institute of technology system (iit system)
学者数:
9.5W
论文数: 9.9W
被引数: 93
引用论文

引用论文

err分享
err收藏
学者 查看更多内容