A Differential Evolution Flower Pollination Algorithm with Dynamic Switch Probability

For the shortcomings of the basic flower pollination algorithm, this paper proposes a differential evolution flower pollination algorithm with dynamic switch probability based on the Weibull distribution.This new algorithm improved the convergence rate and precision. The switch probability is improved by Weibull distribution function combined with the number of iterations. It can balance the relationship between the global pollination and the local pollination to improve the overall optimization performance of the algorithm.Random mutation operator is merged into the global pollination process to increase diversity of the population,enhance the ability of the algorithm's global search and avoid premature convergence. In the process of local pollination, directed mutation and crossover operation of the differential evolution are incorporated, it makes the individual flower position update with the memory function, which can choose the direction of variation reasonably. The use of cross-operation can avoid new solutions crossing the boundary. Convergence rate is improved and the algorithm can approach the global optimal solution continuously. Theoretical analysis proved the convergence and time complexity of the improved algorithm. The simulation results based on the function optimization problem show that the improved algorithm has better performance of optimization, faster convergence speed and higher convergence accuracy.