Journal of System Simulation
Abstract
Abstract: In order to overcome the problems of easily relapsing into local extremum and low speed of convergence, a flower pollination algorithm with invaded weeds strategy was propsed. The algorithm generate dynamically populations, and creased the diversity and effectiveness of population by breeding, spatial diffusion and competition of invasive weeds. It could effectively avoid local optimum, enhance the capacity of global optimization, and improve the convergence speed. The comparison and analysis results of the 8 CEC2005 benchmark functions, the simulation results show that the proposed algorithm has the advantages of better global searching ability, faster convergence and more precise convergence than those of the basic flower pollination algorithm, differential evolution algorithm and bat algorithm.
Recommended Citation
Xiao, Huihui and Duan, Yanming
(2020)
"Flower Pollination Algorithm with Invasive Weed Optimization,"
Journal of System Simulation: Vol. 29:
Iss.
2, Article 5.
DOI: 10.16182/j.issn1004731x.joss.201702005
Available at:
https://dc-china-simulation.researchcommons.org/journal/vol29/iss2/5
First Page
264
Revised Date
2015-06-18
DOI Link
https://doi.org/10.16182/j.issn1004731x.joss.201702005
Last Page
272
CLC
TP301.6
Recommended Citation
Xiao Huihui, Duan Yanming. Flower Pollination Algorithm with Invasive Weed Optimization[J]. Journal of System Simulation, 2017, 29(2): 264-272.
DOI
10.16182/j.issn1004731x.joss.201702005
Included in
Artificial Intelligence and Robotics Commons, Computer Engineering Commons, Numerical Analysis and Scientific Computing Commons, Operations Research, Systems Engineering and Industrial Engineering Commons, Systems Science Commons