返回
Factored Evolutionary Algorithms
DOI:10.1109/TEVC.2016.2601922.png)
摘要
En 中文
Factored evolutionary algorithms (FEAs) are a new class of evolutionary search-based optimization algorithms that have successfully been applied to various problems, such as training neural networks and performing abductive inference in graphical models. An FEA is unique in that it factors the objective function by creating overlapping subpopulations that optimize over a subset of variables of the function. In this paper, we give a formal definition of FEA algorithms and present empirical results related to their performance. One consideration in using an FEA is determining the appropriate factor architecture, which determines the set of variables each factor will optimize. For this reason, we present the results of experiments comparing the performance of different factor architectures on several standard applications for evolutionary algorithms. Additionally, we show that FEA's performance is not restricted by the underlying optimization algorithm by creating FEA versions of hill climbing, particle swarm optimization, genetic algorithm, and differential evolution and comparing their performance to their single-population and cooperative coevolutionary counterparts.
Keyword:
Differential evolution (DE)
genetic algorithm (GA)
NK landscapes
particle swarm optimization (PSO)
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
12
论文数:
2.0K
被引数:
3.1W
机构
引用论文
Transcranial direct current stimulation on prefrontal and parietal areas enhances motor imagery
NeuroReport
IF0
Abductive inference in Bayesian networks using distributed overlapping swarm intelligence基于分布式重叠群智能的贝叶斯网络中的诱导性推理
SOFT COMPUTING
IF2.5

