一种新的受生物学启发的优化算法

U. Premaratne, J. Samarabandu, T. Sidhu
{"title":"一种新的受生物学启发的优化算法","authors":"U. Premaratne, J. Samarabandu, T. Sidhu","doi":"10.1109/ICIINFS.2009.5429852","DOIUrl":null,"url":null,"abstract":"This paper proposes a new biologically inspired algorithm for optimization. The algorithm, called the Paddy Field Algorithm (PFA) operates by initially scattering seeds at random in the parameter space. The number of seeds of each plant depend on the function value such that a plant closer to the optimum solution produces the most seeds. Out of these, depending on the number of neighbors of the plant, only a percentage will become viable due to pollination. In order to prevent getting stuck in local minima, the seeds of each plant are dispersed. This algorithm is tested on four sample functions along side other conventional algorithms. The effect of various parameters on the performance of the algorithm is also investigated. Its performance is also tested with a hybrid algorithm. The results show that the algorithm performs well.","PeriodicalId":117199,"journal":{"name":"2009 International Conference on Industrial and Information Systems (ICIIS)","volume":"52 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"69","resultStr":"{\"title\":\"A new biologically inspired optimization algorithm\",\"authors\":\"U. Premaratne, J. Samarabandu, T. Sidhu\",\"doi\":\"10.1109/ICIINFS.2009.5429852\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper proposes a new biologically inspired algorithm for optimization. The algorithm, called the Paddy Field Algorithm (PFA) operates by initially scattering seeds at random in the parameter space. The number of seeds of each plant depend on the function value such that a plant closer to the optimum solution produces the most seeds. Out of these, depending on the number of neighbors of the plant, only a percentage will become viable due to pollination. In order to prevent getting stuck in local minima, the seeds of each plant are dispersed. This algorithm is tested on four sample functions along side other conventional algorithms. The effect of various parameters on the performance of the algorithm is also investigated. Its performance is also tested with a hybrid algorithm. The results show that the algorithm performs well.\",\"PeriodicalId\":117199,\"journal\":{\"name\":\"2009 International Conference on Industrial and Information Systems (ICIIS)\",\"volume\":\"52 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"69\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 International Conference on Industrial and Information Systems (ICIIS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICIINFS.2009.5429852\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 International Conference on Industrial and Information Systems (ICIIS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICIINFS.2009.5429852","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 69

摘要

本文提出了一种新的受生物学启发的优化算法。该算法被称为水田算法(Paddy Field algorithm, PFA),最初是在参数空间中随机散射种子。每株植物的种子数量取决于函数值,因此,接近最优解的植物产生的种子最多。在这些植物中,根据植物邻居的数量,只有百分之一的植物会因为授粉而存活。为了防止陷入局部极小值,每个植物的种子都被分散。该算法与其他传统算法一起在四个样本函数上进行了测试。研究了各种参数对算法性能的影响。并用混合算法对其性能进行了测试。结果表明,该算法具有良好的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A new biologically inspired optimization algorithm
This paper proposes a new biologically inspired algorithm for optimization. The algorithm, called the Paddy Field Algorithm (PFA) operates by initially scattering seeds at random in the parameter space. The number of seeds of each plant depend on the function value such that a plant closer to the optimum solution produces the most seeds. Out of these, depending on the number of neighbors of the plant, only a percentage will become viable due to pollination. In order to prevent getting stuck in local minima, the seeds of each plant are dispersed. This algorithm is tested on four sample functions along side other conventional algorithms. The effect of various parameters on the performance of the algorithm is also investigated. Its performance is also tested with a hybrid algorithm. The results show that the algorithm performs well.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信