{"title":"An Improved Flower Pollination Algorithm for Global Numerical Optimization","authors":"Kezhong Lu, Zongmin Ma, Xiaofei Yang, Hao Zhou","doi":"10.1109/DCABES50732.2020.00077","DOIUrl":null,"url":null,"abstract":"A new bionic algorithm named as Flower Pollination algorithm (FPA) was proposed by Yang. FPA has some shortcomings, such as premature convergence, low precision, et al. So an improved flower pollination algorithm (IFPA) is proposed in this paper. IFPA combines three aspects: global pollination with quantum search mechanics, local pollination with DE/rand/1 mutation, and switch on dimensions. The experimental results show that IFPA can speed up convergence and improve accuracy.","PeriodicalId":351404,"journal":{"name":"2020 19th International Symposium on Distributed Computing and Applications for Business Engineering and Science (DCABES)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 19th International Symposium on Distributed Computing and Applications for Business Engineering and Science (DCABES)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DCABES50732.2020.00077","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2
Abstract
A new bionic algorithm named as Flower Pollination algorithm (FPA) was proposed by Yang. FPA has some shortcomings, such as premature convergence, low precision, et al. So an improved flower pollination algorithm (IFPA) is proposed in this paper. IFPA combines three aspects: global pollination with quantum search mechanics, local pollination with DE/rand/1 mutation, and switch on dimensions. The experimental results show that IFPA can speed up convergence and improve accuracy.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
