Various strategies for partitioning of memeplexes in shuffled frog leaping algorithm

Abstract

In this paper we propose several methods for partitioning, the process of grouping members of population to different memeplexes, in a shuffled frog leaping algorithm. These proposed methods divide the population in terms of the value of cost function or the geometric position of members or quite random partitioning. The proposed methods are evaluated on several low and high dimensional benchmark functions. The obtained results on low dimensional functions demonstrate that geometric partitioning methods have the best success rate and the fastest performance. Also on high dimensional functions, however using of the geometric partitioning methods for the partitioning stage of the SFL algorithm lead to a better success rate but these methods are more time consuming than other partitioning methods.