LIU Jingsen, LIU Li, LI Yu. A Differential Evolution Flower Pollination Algorithm with Dynamic Switch Probability[J]. Chinese Journal of Electronics, 2019, 28(4): 737-747. doi: 10.1049/cje.2019.04.008
Citation: LIU Jingsen, LIU Li, LI Yu. A Differential Evolution Flower Pollination Algorithm with Dynamic Switch Probability[J]. Chinese Journal of Electronics, 2019, 28(4): 737-747. doi: 10.1049/cje.2019.04.008

A Differential Evolution Flower Pollination Algorithm with Dynamic Switch Probability

doi: 10.1049/cje.2019.04.008
Funds:  This work is supported by the Science & Technology Program of Henan Province, China (No.182102310886, No.162102110109).
More Information
  • Corresponding author: LI Yu (corresponding author) was born in 1969. She received the Ph.D. degree in management science and engineering from University of Shanghai for Science and Technology, China. She is a professor of Institute of Management Science and Engineering, Henan University. Her research interests include intelligence algorithms and electronic commerce, etc. (
  • Received Date: 2018-06-27
  • Rev Recd Date: 2019-01-27
  • Publish Date: 2019-07-10
  • 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.
  • loading
  • R. Eberhart and J. Kennedy, “A new optimizer using particle swarm theory”, IEEE Proceedings of the Sixth International Symposium on Micro Machine and Human Science, pp.39–43, 2002.
    J. Kennedy and R. Eberhart, “Particle swarm optimization”, IEEE International Conference on Neural Networks, Vol.4, pp. 1942–1948, 1995.
    D.E. Goldberg, “Genetic algorithm in search optimization and machine learning”, Addison Wesley, Vol. Xiii, No.7, pp.2104–2116, 1989.
    M. Ali, M. Pant and A. Abraham, “Improving differential evolution algorithm by synergizing different improvement mechanisms”, ACM Transactions on Autonomous and Adaptive Systems, Vol.7, No.2, pp.1–32, 2012.
    K. Bouleimen and H. Lecocq, “A new efficient simulated annealing algorithm for the resource-constrained project scheduling problem and its multiple mode version”, European Journal of Operational Research, Vol.149, No.2, pp.268–281, 2003.
    X.S. Yang, “A new metaheuristic bat-Inspired algorithm”, Computer Knowledge and Technology, Vol.284, pp.65–74, 2010.
    W.C. Pan, “Using fruit fly optimization algorithm optimized general regression neural network to construct the operating performance of enterprises model”, Journal of Taiyuan University of Technology, 2011.
    X. Ma, J. Yang, N. Wu, et al., “A comparative study on decomposition-based multi-objective evolutionary algorithms for many-objective optimization”, IEEE Evolutionary Computation, pp.2477–2483, 2016.
    T. Liu, L. Jiao, W. Ma, et al., “Quantum-behaved particle swarm optimization with collaborative attractors for nonlinear numerical problems”, Communications in Nonlinear Science and Numerical Simulation, Vol.35, pp.167–183, 2017.
    X.S. Yang, “Flower pollination algorithm for global optimization”, Springer-Verlag, pp.240–249, 2012.
    Hakl and H. Uz, “A novel particle swarm optimization algorithm with Levy flight”, Applied Soft Computing, Vol.23, No.5, pp.333–345, 2014.
    X.S. Yang, M. Karamanoglua and X.S. Heb, “Multi-objective flower algorithm for optimization”, Procedia Computer Science, Vol.18, No.1, pp.861–868, 2013.
    D. Rodrigues, X.S. Yang, S.A.N. De, et al., “Binary flower pollination algorithm and its application to feature selection”, Recent Advances in Swarm Intelligence and Evolutionary Computation, pp.85–100, 2015.
    H.M. Dubey, “Hybrid flower pollination algorithm with timevarying fuzzy selection mechanism for wind integrated multiobjective dynamic economic dispatch”, Renewable Energy, Vol.83, pp.188–202, 2015
    R. Jensi and G.W. Jiji, “Hybrid data clustering approach using K-Means and flower pollination algorithm”, Computer Science, 2015.
    Q. Jiao, D. Xu and C. Li, “Product disassembly sequence planning based on flower pollination algorithm”, Computer Integrated Manufacturing Systems, Vol.22, No.12, pp.2791–2799, 2016.
    M. Bensouyad and D.E. Saidouni, “A discrete flower pollination algorithm for graph coloring problem”, IEEE International Conference on Cybernetics, pp.151–155, 2015.
    D.F. Alam, D.A. Yousri and M.B. Eteiba, “Flower pollination algorithm based solar PV parameter estimation”, Energy Conversion and Management, Vol.101, pp.410–422, 2015.
    Z.A.E.M. Dahi, C. Mezioud and A. Draa, “On the efficiency of the binary flower pollination algorithm: Application on the antenna positioning problem”, Applied Soft Computing, Vol.47, No.C, pp.395–414, 2016.
    R. Salgotra and U. Singh, “Application of mutation operators to flower pollination algorithm”, Expert Systems with Applications, pp.79, 2017.
    A.R. Osama, A.B. Mohamed and I. El-Henawy, “A new hybrid flower pollination algorithm for solving constrained global optimization problems”, International Journal of Applied Operational Research, 2014.
    R. Wang, Y.Q. Zhou, S.L. Qiao, et al., “Flower pollination algorithm with bee pollinator for cluster analysis”, Information Processing Letters, Vol.116, No.1, pp.1–14, 2016.
    L. Kn, B.R. Reddy and M.S. Kalavathi, “Shrinkage of active power loss by hybridization of flower pollination algorithm with chaotic harmony search algorithm”, Control Theory & Informatics, 2014.
    E. Nabil, “A Modified flower pollination algorithm for global optimization”, Expert Systems with Applications, Vol.57, pp.192–203, 2016.
    A. Draa, “On the performances of the flower pollination algorithm-qualitative and quantitative analyses”, Applied Soft Computing, Vol.34, pp.349–371, 2015.
    W.Y. Zhang, Z.X. Qu, K.Q. Zhang, et al., “A combined model based on CEEMDAN and modified flower pollination algorithm for wind speed forecasting”, Energy Conversion & Management, Vol.136, pp.439–451, 2017.
    J.R. Zhou, J.S. Yang, L. Lin, et al., “A local best particle swarm optimization based on crown jewel defense strategy”, International Journal of Swarm Intelligence Research, Vol.6, No.1, pp.41–63, 2015.
    C.D. Lai, M. Xie, D.N.P. Murthy, et al., “A modified Weibull distribution”, IEEE Transactions on Reliability, Vol.52, No.1, pp.33–37, 2003.
    W. Liu and G. Liu, “Genetic algorithm with directional mutation based on greedy strategy for large-scale 0-1 knapsack problems”, International Journal of Advancements in Computing Technology, Vol.4, No.3, pp.66–74, 2012.
    S. Walton, O. Hassan, K. Morgan, et al., “Modified cuckoo search: a new gradient free optimisation algorithm”, Chaos Solitons & Fractals, Vol.44, No.9, pp.710–718, 2011.
    H.B. Liu, et al., “Convergence analysis of particle swarm optimization and its improved algorithm based on chaos”, Control and Decision, Vol.21, No.6, pp.636–640, 2006.
    Z.Y. Li, L. Ma, H.Z. Zhang, et al., “Convergence analysis of a bat algorithm”, Mathematics Practice and Understanding, Vol.43, No.12, pp.182–190, 2013.
    R. Wang, Y.Q. Zhou, C.Y. Zhao, et al., “A hybrid flower pollination algorithm based modified randomized location for multi-threshold medical image segmentation”, Bio-medical materials and engineering, Vol.26, Supplement 1, pp.S1345–S1351, 2015.
    H. Wang, et al., “An improved global particle swarm optimization algorithm”, Control and Decision, Vol.7, pp.1161–1168, 2016.
    X.B. Meng, X.Z. Gao, Y. Liu, et al., “A novel bat algorithm with habitat selection and doppler effect in echoes for optimization”, Expert Systems with Applications, Vol.42, No.17-18, pp.6350–6364, 2015.
    Y. Li, Y.H. Pei and J.S. Liu, “Bat optimal algorithm combined uniform mutation with gaussian mutation”, Control and Decision, Vol.32, No.10, pp.1775–1781, 2017.
    Y. Tao, F.X. Liu and B. Chen, “New particle swarm optimisation algorithm with henon chaotic map structure”, Chinese Journal of Electronics, Vol.26, No.4, pp.747–753, 2017.
    S.F. Liu, P.F. Wang and J.C. Zhang, “An improved biogeography-based optimization algorithm for blocking flow shop scheduling problem”, Chinese Journal of Electronics, Vol.27, No.2, pp.351–358, 2018.
    L.L. Li, L.C. Jiao, J.Q. Zhao, et al., “Quantum-behaved discrete multi-objective particle swarm optimization for complex network clustering”, Pattern Recognition, Vol.63, pp.1–14, 2017.
    X.M. Wang, S. Liu, Q.M. Li, et al., “Underwater sonar image detection: a novel quantum-inspired shuffled frog leaping algorithm”, Chinese Journal of Electronics, Vol.27, No.3, pp.588–594, 2018.
  • 加载中


    通讯作者: 陈斌,
    • 1. 

      沈阳化工大学材料科学与工程学院 沈阳 110142

    1. 本站搜索
    2. 百度学术搜索
    3. 万方数据库搜索
    4. CNKI搜索

    Article Metrics

    Article views (170) PDF downloads(227) Cited by()
    Proportional views


    DownLoad:  Full-Size Img  PowerPoint