The role of basic, modified and hybrid shuffled frog leaping algorithm on optimization problems: a review

• Main Authors: Sarkheyli, Arezoo, Zain, Azlan Mohd., Sharif, Safian
• Format: Article
• Published: Springer Verlag 2015
• Subjects: QA75 Electronic computers. Computer science
• Online Access: http://eprints.utm.my/id/eprint/58990/; http://dx.doi.org/10.1007/s00500-014-1388-4
• Institution: Universiti Teknologi Malaysia

Shuffled frog leaping algorithm (SFLA) is a meta-heuristic to handle different large-scale optimization problems. SFLA is a population-based algorithm that combines the advantages of memetic algorithm and particle swarm optimization. This paper compares previous researches on SFLA and its effectiveness, with the most applied optimization algorithms reviewed and analyzed. Based on the literature, many efforts by previous researchers on SFLA denote the next generations of basic SFLA with diverse structures for modified SFLA or hybrid SFLA. As well, an attempt is made to highlight these structures, their enhancements and advantages. Moreover, this paper considers top improvements on SFLA for solving multi-objective optimization problems, enhancing local and global exploration, avoiding being trapped into local optima, declining computational time and improving the quality of the initial population. The measured enhancements in SFLA are based on the statistical results obtained from 89 published papers and by considering the most common and effective modifications done by a large number of researchers. Finally, the quantitative validations address the SFLA as a robust algorithm employed in various applications which outperforms the other optimization algorithms.