Volume 52, Number 2, April–June 2018
|Page(s)||429 - 438|
|Published online||22 June 2018|
Convergence analysis of the plant propagation algorithm for continuous global optimization
Laboratoire de Mathématiques Appliquées, Faculté des Sciences Exactes, Université de Bejaia,
2 Department of Mathematical Sciences, Faculty of Science and Health, University of Essex, CO4 3SQ, United Kingdom.
3 Institut des Sciences et de la Technologie, Centre Universitaire Morsli Abdellah de Tipaza, 42000 Tipaza, Algeria.
* Corresponding author: e-mail: firstname.lastname@example.org
Accepted: 6 May 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.
Mathematics Subject Classification: 90C09 / 05C15
Key words: Strawberry algorithm / randomised algorithms / convergence analysis / global optimisation
© EDP Sciences, ROADEF, SMAI 2018
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.