arrow
返回

Dynamic multi-objective evolutionary algorithms for single-objective optimization

delete2017-12-01
delete20
delete
OA
AI
R
Ruwang Jiao
S
Sanyou Zeng *
J
Jawdat S. Alkasassbeh
C
Changhe Li
DOI:10.1016/j.asoc.2017.08.030delete
delete原文链接
delete分享
delete收藏
查看原文
摘要

摘要

En 中文
This paper proposes a new method for handling the difficulty of multi-modality for the single-objective optimization problem (SOP). The method converts a SOP to an equivalent dynamic multi-objective optimization problem (DMOP). A new dynamic multi-objective evolutionary algorithm (DMOEA) is implemented to solve the DMOP. The DMOP has two objectives: the original objective and a niche-count objective. The second objective aims to maintain the population diversity for handling the multi-modality difficulty during the search process. Experimental results show that the performance of the proposed algorithm is significantly better than the state-of-the-art competitors on a set of benchmark problems and real world antenna array problems. (C) 2017 Elsevier B.V. All rights reserved.
Keyword:
Evolutionary computation
Multi-objective optimization
Niching
Dynamic optimization
Antenna array
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

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

机构

C
China University of Geosciences
学者数:
3.7W
论文数: 2.8W
被引数: 4.3W
引用论文

引用论文

err分享
err收藏
err分享
err收藏
err分享
err收藏
Improving Diversity in Evolutionary Algorithms: New Best Solutions for Frequency Assignment
err2017-08-01
err41
PREAI
errSegura, Carlos; Hernandez-Aguirre, Arturo; Luna, Francisco; Alba, Enrique
err分享
err收藏
学者 查看更多内容