Abstract
Flower pollination algorithm (FPA) is susceptible to local optimum and substandard precision of calculations. Chaotic operator (CO), which is used in local algorithms to optimize the best individuals in the population, can successfully enhance the properties of the flower pollination algorithm. A new chaotic flower pollination algorithm (CFPA) has been proposed in this work. Further FPA and its four proposed variants by using different chaotic maps are tested on nine mathematical benchmark functions of high dimensions. Proposed variants of CFPA are CFPA1, CFPA2, CFPA3 and CFPA4. The result of the experiment indicates that the proposed chaotic flower pollination variant CFPA2 could increase the precision of minimization of function value and CPU time to run an algorithm.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call