.png){kind=icon}
返回
Sequence-Based Deterministic Initialization for Evolutionary Algorithms
.png){kind=icon}
OA
AI
DOI：10.1109/TCYB.2016.2630722.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
It is well known that the performances of evolutionary algorithms are influenced by the quality of their initial populations. Over the years, many different techniques for generating an initial population by uniformly covering as much of the search space as possible have been proposed. However, none of these approaches considers any input from the function that must be evolved using that population. In this paper, a new initialization technique, which can be considered a heuristic space-filling approach, based on both function to be optimized and search space, is proposed. It was tested on two well-known unconstrained sets of benchmark problems using several computational intelligence algorithms. The results obtained reflected its benefits as the performances of all these algorithms were significantly improved compared with those of the same algorithms with currently available initialization techniques. The new technique also proved its capability to provide useful information about the function's behavior and, for some test problems, the initial population produced high-quality solutions. This method was also tested on a few multiobjective problems, with the results demonstrating its benefits.
Keyword:
Evolutionary algorithms (EAs)
experimental design
population initialization
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
10.5
论文数:
1.1W
被引数:
5.0W
机构
引用论文
.png){kind=icon}
Differential Evolution Algorithm With Strategy Adaptation for Global Numerical Optimization求解全局数值优化问题的策略自适应差分进化算法
OAAI
OAAI分享收藏分享收藏Differential evolution algorithm with ensemble of parameters and mutation strategies具有参数集成和变异策略的差分进化算法
PREAI
分享收藏
查看更多内容