.png){kind=icon}
返回
An evolutionary approach to constrained sampling optimization problems
.png){kind=icon}
PRE
AI
DOI：10.1016/j.asoc.2016.12.002.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Constrained sampling optimization problems conform a class of problems where only a part of the solution space is available from any point at any time. That is, one cannot freely choose any point for evaluation at a given time. Evolutionary algorithms are quite inefficient over these problems, as their usual implementations assume that any point in the solution space can be evaluated any time and at no cost. This paper deals with how to modify the general strategy of evolutionary algorithms to address these constraints in an efficient manner and proposes extending their application to other problems that, even though, they are not strictly constrained sampling problems, restricting their sampling capabilities reduces the cost of the optimization procedure without affecting its results. The behavior of the Constrained Sampling Differential Evolution (CS-DE) algorithm is studied as a paradigmatic example of this approach. This study is carried out over a representative set of benchmark functions of different dimensionalities that permit validating the approach and demonstrating its improved efficiency over fitness landscapes with a variety of characteristics. (C) 2016 Elsevier B.V. All rights reserved.
Keyword:
Optimization
Evolutionary algorithms
Constrained sampling problems
Constrained sampling evolutionary
algorithm
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.6
论文数:
1.4W
被引数:
4.8W
机构
引用论文
.png){kind=icon}
An improved evolutionary method with fuzzy logic for combining Particle Swarm Optimization and Genetic Algorithms一种改进的基于模糊逻辑的粒子群和遗传算法相结合的进化方法
PREAI
分享收藏分享收藏分享收藏分享收藏
查看更多内容