4.6 Article

Convergence analysis of butterfly optimization algorithm

期刊

SOFT COMPUTING
卷 -, 期 -, 页码 -

出版社

SPRINGER
DOI: 10.1007/s00500-023-07920-8

关键词

Metaheuristic; Butterfly optimization algorithm; Markov chain; Global convergence

向作者/读者索取更多资源

This paper analyzes the convergence behavior of the Butterfly Optimization Algorithm (BOA) by developing a Markov chain model. It mathematically proves the global convergence of BOA based on the analysis using the Markov chain model and the global convergence theorem. The impact of other factors on the convergence rate of BOA is experimentally demonstrated, and a comparison with other state-of-the-art algorithms is conducted. The effects of sensory modality and power exponent on the performance of BOA are also studied.
Convergence analysis of any random search algorithm helps to verify whether and how quickly the algorithm guarantees convergence to the point of interest. Butterfly optimization algorithm (BOA) is a popular population-based stochastic optimizer introduced by mimicking the foraging behaviors of butterflies in nature. In this paper, we have developed the Markov chain model of the BOA and analyzed the convergence behavior of the algorithm. The Markov chain model of the BOA is constituted where the population sequence generated by the algorithm is found to be a finite homogenous Markov chain and the defined population state set is found to be reducible. Convergence analysis of the algorithm is performed mathematically using the Markov chain model of the algorithm with the help of global convergence theorem which is based on a random search algorithm satisfying two subtle conditions. The butterfly algorithm has been found to satisfy the conditions for the global convergence theorem to enact, whereof it guarantees the global convergence of the BOA. We have also tried to show experimentally that the convergence of the algorithm does not always have considerable impact on rate of convergence as it is influenced by various other factors. Moreover, the convergence of BOA has been compared with several state-of-the-art algorithms experimentally. Further, the effects of the parameters, namely sensory modality and power exponent on the performance of BOA, have been studied.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.6
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据