A Compact Flower Pollination Algorithm Optimization

A restricted hardware condition is difficult for optimization problems. This paper proposes a novel compact flower pollination algorithm for addressing the class of optimization problems in the restricted hardware condition. In this proposed method, the actual population of tentative solutions is not stored, but a novel probabilistic representation on the population is employed based on the single competition. In the simulation, several problems of numerical optimizations in the benchmark are used to evaluate the accuracy, the computational time and the saving memory of the proposed method. The results compared with the original algorithm and the other algorithms in the literature show that the new proposed method provides the effective way of using a limited memory.