Reptile Search Algorithm Considering Different Flight Heights to Solve Engineering Optimization Design Problems.

Abstract

The reptile search algorithm is an effective optimization method based on the natural laws of the biological world. By restoring and simulating the hunting process of reptiles, good optimization results can be achieved. However, due to the limitations of natural laws, it is easy to fall into local optima during the exploration phase. Inspired by the different search fields of biological organisms with varying flight heights, this paper proposes a reptile search algorithm considering different flight heights. In the exploration phase, introducing the different flight altitude abilities of two animals, the northern goshawk and the African vulture, enables reptiles to have better search horizons, improve their global search ability, and reduce the probability of falling into local optima during the exploration phase. A novel dynamic factor (DF) is proposed in the exploitation phase to improve the algorithm's convergence speed and optimization accuracy. To verify the effectiveness of the proposed algorithm, the test results were compared with ten state-of-the-art (SOTA) algorithms on thirty-three famous test functions. The experimental results show that the proposed algorithm has good performance. In addition, the proposed algorithm and ten SOTA algorithms were applied to three micromachine practical engineering problems, and the experimental results show that the proposed algorithm has good problem-solving ability.