.png){kind=icon}
返回
An improvement decomposition-based multi-objective evolutionary algorithm using multi-search strategy
.png){kind=icon}
PRE
AI
DOI：10.1016/j.knosys.2018.09.018.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The main goal of multi-objective optimization evolutionary algorithms (MOEAs) is to obtain a set of solutions with good diversity and convergence. However, how to concurrently improve the diversity and convergence is a difficult work. To address this problem, an updated strategy based on decomposition is used to maintain the diversity, and the convergence is enhanced by improving the search efficiency. In this paper, an improvement decomposition-based multi-objective evolutionary algorithm using multi-search strategy is aimed at improving the search efficiency. In this work, three search strategies are used to help crossover operators to carry out the local search and global search. This multi-search strategy selects sparse non-dominated solutions to carry out the exploration, and selects convergent solutions to implement the exploitation. In the experiments, the proposed algorithm is compared with seven efficient state-of-the-art algorithms, e.g., NSGAII, MOEA/D, MOEA-DVA, MOEA-IGD-NS, MOEA/D-PaS, RVEA and MPSOD, on twenty-two benchmark functions. Empirical results show that the proposed algorithm can find a set of solutions with better diversity and convergence than six compared algorithms. (C) 2018 Elsevier B.V. All rights reserved.
Keyword:
Multi-objective optimization
Decomposition
Multi-search strategy
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
K
IF:
7.6
论文数:
1.3W
被引数:
4.5W
机构
引用论文
.png){kind=icon}
An Improved Multiobjective Optimization Evolutionary Algorithm Based on Decomposition for Complex Pareto Fronts一种改进的基于复杂帕累托前沿分解的多目标优化进化算法
OAAI
OAAI分享收藏PlatEMO: A MATLAB Platform for Evolutionary Multi-Objective OptimizationPlatEMO: 用于进化多目标优化的MATLAB平台OAAI
OAAI分享收藏
分享收藏分享收藏分享收藏分享收藏
查看更多内容