.png){kind=icon}
返回
Efficient fractal-based mutation in evolutionary algorithms from iterated function systems
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cnsns.2017.08.010.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper we present a new mutation procedure for Evolutionary Programming (EP) approaches, based on Iterated Function Systems (IFSs). The new mutation procedure proposed consists of considering a set of IFS which are able to generate fractal structures in a two-dimensional phase space, and use them to modify a current individual of the EP algorithm, instead of using random numbers from different probability density functions. We test this new proposal in a set of benchmark functions for continuous optimization problems. In this case, we compare the proposed mutation against classical Evolutionary Programming approaches, with mutations based on Gaussian, Cauchy and chaotic maps. We also include a discussion on the IFS-based mutation in a real application of Tuned Mass Dumper (TMD) location and optimization for vibration cancellation in buildings. In both practical cases, the proposed EP with the IFS-based mutation obtained extremely competitive results compared to alternative classical mutation operators. (C) 2017 Elsevier B.V. All rights reserved.
Keyword:
Evolutionary programming
Mutation procedures design
Iterated function systems
Fractals
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.8
论文数:
9.2K
被引数:
1.8W
机构
引用论文
.png){kind=icon}
分享收藏Use of chaotic sequences in a biologically inspired algorithm for engineering design optimization
PREAI
分享收藏
查看更多内容