A novel Fruit Fly Optimization Algorithm with quasi-affine transformation evolutionary for numerical optimization and application

Abstract

The Fruit Fly Optimization Algorithm is a swarm intelligence algorithm with strong versatility and high computational efficiency. However, when faced with complex multi-peak problems, Fruit Fly Optimization Algorithm tends to converge prematurely. In response to this situation, this article proposes a new optimized structure—Quasi-affine Transformation evolutionary for the Fruit fly Optimization Algorithm. The new algorithm uses the evolution matrix in QUasi-Affine TRansformation Evolution algorithm to update the position coordinates of particles. This strategy makes the movement of particles more scientific and the search space broader. In order to prove its effectiveness, we compare Quasi-affine Transformation evolutionary for the Fruit fly Optimization Algorithm with five other mature intelligent algorithms, and test them on 22 different types of benchmark functions. In order to observe the multi-faceted performance of Quasi-affine Transformation evolutionary for the Fruit fly Optimization Algorithm more intuitively, we also conduct experiments on algorithm convergence analysis, the Friedman test, the Wilcoxon signed-rank test, and running time comparison. Through the above several comparative experiments, Quasi-affine Transformation evolutionary for the Fruit fly Optimization Algorithm has indeed demonstrated its strong competitiveness. Finally, we apply it to Capacitated Vehicle Routing Problem. Through comparing with the contrast algorithms, it is confirmed that Quasi-affine Transformation evolutionary for the Fruit fly Optimization Algorithm can achieve better vehicle routes planning.