.png){kind=icon}
返回
Grid-based dynamic robust multi-objective brain storm optimization algorithm
.png){kind=icon}
PRE
AI
DOI：10.1007/s00500-019-04365-w.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Rich works have been done on brain storm optimization algorithm solving static single- or multi-objective optimization problems, but less reports for dynamic multi-objective optimization problems. Based on this, a grid-based multi-objective brain storming algorithm with hybrid mutation operation is proposed to find the robust Pareto-optimal solution set over time. Grid-based clustering method partitions the objective space evenly along each objective and classifies the individuals located in the same grid into a cluster. Its computational complexity is less than k-means- and group-based clustering strategies. Traditional Gaussian-, Cauchy- and Chaotic-based mutation operators have different mutation steps and generate the new individuals with various diversity. In order to enhance the diversity and avoiding the premature convergence, a hybrid mutation strategy integrating above three mutation operators is presented. Experimental results for eight dynamic multi-objective benchmark functions show that the proposed algorithm can find robust Pareto-optimal solutions approximating the true Pareto front under more subsequent environments with the acceptable fitness threshold. The longer survival time also indicates that grid-based clustering method and hybrid mutation strategy are apt to better robustness.
Keyword:
Grid-based clustering
Hybrid mutation
Robust Pareto-optimum over time
Multi-objective brain storm optimization algorithm
Dynamic
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
2.5
论文数:
1.0W
被引数:
2.1W
机构
引用论文
.png){kind=icon}
A Hybrid Method to Solve Data Sparsity in Travel Recommendation Agents Using Fuzzy Logic Approach
OAAI
OAAI分享收藏
查看更多内容