A Flower Pollination Optimization Algorithm Based on Cosine Cross-Generation Differential Evolution

Abstract

The flower pollination algorithm (FPA) is a novel heuristic optimization algorithm inspired by the pollination behavior of flowers in nature. However, the global and local search processes of the FPA are sensitive to the search direction and parameters. To solve this issue, an improved flower pollination algorithm based on cosine cross-generation differential evolution (FPA-CCDE) is proposed. The algorithm uses cross-generation differential evolution to guide the local search process, so that the optimal solution is achieved and sets cosine inertia weights to increase the search convergence speed. At the same time, the external archiving mechanism and the adaptive adjustment of parameters realize the dynamic update of scaling factor and crossover probability to enhance the population richness as well as reduce the number of local solutions. Then, it combines the cross-generation roulette wheel selection mechanism to reduce the probability of falling into the local optimal solution. In comparing to the FPA-CCDE with five state-of-the-art optimization algorithms in benchmark functions, we can observe the superiority of the FPA-CCDE in terms of stability and optimization features. Additionally, we further apply the FPA-CCDE to solve the robot path planning issue. The simulation results demonstrate that the proposed algorithm has low cost, high efficiency, and attack resistance in path planning, and it can be applied to a variety of intelligent scenarios.

Keywords

• flower pollination algorithm (FPA)
• cross-generation
• differential evolution (DE)
• external archive
• roulette wheel
• robot path planning