Adaptive mutation quantum-inspired squirrel search algorithm for global optimization problems

doi:10.1016/j.aej.2021.11.051

2022-09-01

Yanan Zhang

Chunwu Wei

赵

赵娟娟 (Juanjuan Zhao) *

DOI：10.1016/j.aej.2021.11.051

原文链接

查看原文

摘要

En 中文

This paper presents a novel Adaptive Mutation Quantum-inspired Squirrel Search Algorithm (AM-QSSA). Firstly, based on the population mutation, a location-update of quantum state correlative and attractor method is proposed. By introducing a random process to modify the sliding factor of the local attractor, the inevitable lack of diversity in the population renewal method is solved. The premature convergence problem of adaptive mutation rate improvement algorithm based on squirrel position update mode is introduced. Meanwhile, the paper decomposes the location update process of the SSA, and improves it with quantum-behavior. Furthermore, it proposes a novel quantum-inspired squirrels search algorithm. This method finds the complementary effect between quantum behavior and squirrel search algorithm, and solves the problem of premature convergence probability of SSA. In addition, it improves population diversity, and achieves the balance between global and local search. The efficiency of the proposed AM-QSSA is evaluated using exploitation analysis, exploration analysis, success rate analysis, convergence rate analysis on classical benchmark functions as well as Congress on Evolutionary Computation (CEC) 2017 test functions. For further study, AM-QSSA optimizes an image registration problem for an extensive study to check its applicability. The results reveal that AM-QSSA is more efficient and stable than SSA. And it is comparable to the most advanced optimization algorithms.(c) 2022 THE AUTHORS. Published by Elsevier BV on behalf of Faculty of Engineering, Alexandria University. This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/ licenses/by-nc-nd/4.0/).

Keyword:

Metaheuristic method

Squirrel search algorithm

(SSA)

Quantum theory

Unconstrained optimization

Self-adaptive mutation