Convergence analysis of the plant propagation algorithm for continuous global optimization
Nassim Brahimi, Abdellah Salhi, Megdouda Ourbih-Tari · RAIRO - Operations Research · 2017
The Plant Propagation Algorithm (PPA) is a Nature-Inspired stochastic algorithm, which emulates the way plants, in particular the strawberry plant, propagate using runners. It has been experimentally tested both on unconstrained and constrained continuous global optimization problems and was found to be competitive against well established algorithms. This paper is concerned with its convergence analysis. It first puts forward a general convergence theorem for a large class of random algorithms, before the PPA convergence theorem is derived and proved. It then illustrates the results on simple problems.