Global convergence analysis of the flower pollination algorithm: a Discrete-Time Markov Chain Approach

He, Xingshi and Yang, Xin-She and Karamanoglu, Mehmet and Zhao, Yuxin (2017) Global convergence analysis of the flower pollination algorithm: a Discrete-Time Markov Chain Approach. In: International Conference on Computational Science, ICCS 2017, 12-14 Jun 2017, Zurich, Switzerland.

[img]
Preview
PDF - Published version (with publisher's formatting)
Available under License Creative Commons Attribution-NonCommercial-NoDerivatives.

Download (475kB) | Preview

Abstract

Flower pollination algorithm is a recent metaheuristic algorithm for solving nonlinear global optimization problems. The algorithm has also been extended to solve multiobjective optimization with promising results. In this work, we analyze this algorithm mathematically and prove its convergence properties by using Markov chain theory. By constructing the appropriate transition probability for a population of flower pollen and using the homogeneity property, it can be shown that the constructed stochastic sequences can converge to the optimal set. Under the two proper conditions for convergence, it is proved that the simplified flower pollination algorithm can indeed satisfy these convergence conditions and thus the global convergence of this algorithm can be guaranteed. Numerical experiments are used to demonstrate that the flower pollination algorithm can converge quickly in practice and can thus achieve global optimality efficiently.

Item Type: Conference or Workshop Item (Paper)
Research Areas: A. > School of Science and Technology > Design Engineering and Mathematics
Item ID: 22008
Notes on copyright: Copyright: © 2017 The Author(s). Published by Elsevier B.V.
Useful Links:
Depositing User: Xin-She Yang
Date Deposited: 15 Jun 2017 09:58
Last Modified: 14 Sep 2018 10:20
URI: http://eprints.mdx.ac.uk/id/eprint/22008

Actions (login required)

Edit Item Edit Item

Full text downloads (NB count will be zero if no full text documents are attached to the record)

Downloads per month over the past year