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

Verfasser / Beitragende:
[Arezoo Sarkheyli, Azlan Zain, Safian Sharif]
Ort, Verlag, Jahr:
2015
Enthalten in:
Soft Computing, 19/7(2015-07-01), 2011-2038
Format:
Artikel (online)
ID: 605469105
LEADER caa a22 4500
001 605469105
003 CHVBK
005 20210128100320.0
007 cr unu---uuuuu
008 210128e20150701xx s 000 0 eng
024 7 0 |a 10.1007/s00500-014-1388-4  |2 doi 
035 |a (NATIONALLICENCE)springer-10.1007/s00500-014-1388-4 
245 0 4 |a The role of basic, modified and hybrid shuffled frog leaping algorithm on optimization problems: a review  |h [Elektronische Daten]  |c [Arezoo Sarkheyli, Azlan Zain, Safian Sharif] 
520 3 |a 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. 
540 |a Springer-Verlag Berlin Heidelberg, 2014 
690 7 |a Shuffled frog leaping algorithm  |2 nationallicence 
690 7 |a Optimization  |2 nationallicence 
690 7 |a Modification  |2 nationallicence 
690 7 |a Hybridization  |2 nationallicence 
690 7 |a Application  |2 nationallicence 
690 7 |a Comparison  |2 nationallicence 
690 7 |a Review  |2 nationallicence 
700 1 |a Sarkheyli  |D Arezoo  |u Soft Computing Research Group, Faculty of Computing, Universiti Teknologi Malaysia, 81310, UTM Skudai, Johor, Malaysia  |4 aut 
700 1 |a Zain  |D Azlan  |u Soft Computing Research Group, Faculty of Computing, Universiti Teknologi Malaysia, 81310, UTM Skudai, Johor, Malaysia  |4 aut 
700 1 |a Sharif  |D Safian  |u Department of Manufacturing and Industrial Engineering, Faculty of Mechanical Engineering, Universiti Teknologi Malaysia, 81310, UTM Skudai, Johor, Malaysia  |4 aut 
773 0 |t Soft Computing  |d Springer Berlin Heidelberg  |g 19/7(2015-07-01), 2011-2038  |x 1432-7643  |q 19:7<2011  |1 2015  |2 19  |o 500 
856 4 0 |u https://doi.org/10.1007/s00500-014-1388-4  |q text/html  |z Onlinezugriff via DOI 
898 |a BK010053  |b XK010053  |c XK010000 
900 7 |a Metadata rights reserved  |b Springer special CC-BY-NC licence  |2 nationallicence 
908 |D 1  |a research-article  |2 jats 
949 |B NATIONALLICENCE  |F NATIONALLICENCE  |b NL-springer 
950 |B NATIONALLICENCE  |P 856  |E 40  |u https://doi.org/10.1007/s00500-014-1388-4  |q text/html  |z Onlinezugriff via DOI 
950 |B NATIONALLICENCE  |P 700  |E 1-  |a Sarkheyli  |D Arezoo  |u Soft Computing Research Group, Faculty of Computing, Universiti Teknologi Malaysia, 81310, UTM Skudai, Johor, Malaysia  |4 aut 
950 |B NATIONALLICENCE  |P 700  |E 1-  |a Zain  |D Azlan  |u Soft Computing Research Group, Faculty of Computing, Universiti Teknologi Malaysia, 81310, UTM Skudai, Johor, Malaysia  |4 aut 
950 |B NATIONALLICENCE  |P 700  |E 1-  |a Sharif  |D Safian  |u Department of Manufacturing and Industrial Engineering, Faculty of Mechanical Engineering, Universiti Teknologi Malaysia, 81310, UTM Skudai, Johor, Malaysia  |4 aut 
950 |B NATIONALLICENCE  |P 773  |E 0-  |t Soft Computing  |d Springer Berlin Heidelberg  |g 19/7(2015-07-01), 2011-2038  |x 1432-7643  |q 19:7<2011  |1 2015  |2 19  |o 500