{"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.