Fractional-order calculus-based flower pollination algorithm with local search for global optimization and image segmentation

作者:

Highlights:

摘要

Introducing a novel approach to enhance the diversification and intensification propensities of the flower pollination algorithm (FPA) is the main aim of this paper. Therefore, the fractional-order (FO) calculus features are adopted to enhance the basic FPA local search ability and adaptive modify the harmonization coefficient among the FPA exploration and exploitation cores. The proposed Fractional-order FPA (FO-FPA) is examined in a number of experiments. Firstly, FO-FPA is tested with thirty-six benchmark functions with several dimensions. The proposed FO-FPA is compared with recent proved techniques based on several statistical measures and non parametric tests. Secondly, FO-FPA is implemented for a real application of the image segmentation and its results compared with state-of-the-art multi-level thresholding algorithms. The comparisons divulge the remarkable influence of merging FO with the basic FPA in improving the quality of the solutions and the acceleration of the convergence speed.

论文关键词:Flower pollination algorithm,Local search,Meta-heuristic,Image segmentation,Fractional calculus,Optimization,Algorithm,Benchmark

论文评审过程:Received 31 December 2019, Revised 6 March 2020, Accepted 6 April 2020, Available online 11 April 2020, Version of Record 24 April 2020.

论文官网地址:https://doi.org/10.1016/j.knosys.2020.105889