A new evolutionary optimization algorithm inspired by Plant Life Cycle

M. Karami, A. Moosavinia, Mahdi Ehsanian, M. Teshnelab
{"title":"A new evolutionary optimization algorithm inspired by Plant Life Cycle","authors":"M. Karami, A. Moosavinia, Mahdi Ehsanian, M. Teshnelab","doi":"10.1109/IRANIANCEE.2015.7146281","DOIUrl":null,"url":null,"abstract":"In this paper a new evolutionary optimization algorithm inspired by Plant Life Cycle is proposed. Plants are quite successful in reproduction and searching new habitats despite of their mobility limitations. During millions of years plants continued to innovate new ways of exploiting other animals and peripheral conditions and using them as part of their reproduction cycle. Thanks to these innovations, they not only produce new generations but effectively do local as well as global search in their environment. The proposed algorithm uses general concepts in plant life cycle to form an optimization method. It searches problem space in six steps named: pollination, fertilization, seed production, seed dispersal, local competition and selection to find best possible answer. The proposed algorithm has been implemented on some known test functions and simulation results of proposed algorithm are compared with Genetic algorithm and Cuckoo search algorithm results. Results demonstrate the superiority of new algorithm in most tests over two other algorithms in searching the solution space especially in high dimensions.","PeriodicalId":187121,"journal":{"name":"2015 23rd Iranian Conference on Electrical Engineering","volume":"103 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 23rd Iranian Conference on Electrical Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IRANIANCEE.2015.7146281","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

In this paper a new evolutionary optimization algorithm inspired by Plant Life Cycle is proposed. Plants are quite successful in reproduction and searching new habitats despite of their mobility limitations. During millions of years plants continued to innovate new ways of exploiting other animals and peripheral conditions and using them as part of their reproduction cycle. Thanks to these innovations, they not only produce new generations but effectively do local as well as global search in their environment. The proposed algorithm uses general concepts in plant life cycle to form an optimization method. It searches problem space in six steps named: pollination, fertilization, seed production, seed dispersal, local competition and selection to find best possible answer. The proposed algorithm has been implemented on some known test functions and simulation results of proposed algorithm are compared with Genetic algorithm and Cuckoo search algorithm results. Results demonstrate the superiority of new algorithm in most tests over two other algorithms in searching the solution space especially in high dimensions.
受植物生命周期启发的一种新的进化优化算法
本文提出了一种受植物生命周期启发的进化优化算法。植物在繁殖和寻找新栖息地方面相当成功,尽管它们的移动性有限。在数百万年的时间里,植物不断创新利用其他动物和周边环境的新方法,并将它们作为其繁殖周期的一部分。由于这些创新,他们不仅产生了新的一代,而且有效地在他们的环境中进行本地和全球搜索。该算法采用植物生命周期的一般概念,形成一种优化方法。它通过六个步骤搜索问题空间:授粉、受精、种子生产、种子传播、局部竞争和选择,以找到最佳可能的答案。本文提出的算法已在一些已知的测试函数上实现,并与遗传算法和布谷鸟搜索算法的仿真结果进行了比较。结果表明,在大多数测试中,新算法在搜索高维解空间方面优于其他两种算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信