Abstract
Shuffled frog-leaping algorithm (SFLA) is a recent addition to the family of nature-inspired metaheuristic algorithms (NIMA). SFLA has proved its efficacy in solving intricate and real-world optimization problems. In the present study, we have hybridized SFLA into other well-known metaheuristic algorithm called differential evolution (DE) algorithm to enhance the searching capability as well as to maintain the diversity of population. Hybridization is a growing area of interest in research. The process of hybridization results into a new variant that combines the advantages of two or more metaheuristic algorithms in a judicious manner. In this paper, the new variant is named as differential SFLA (DSFLA). The proposal is implemented and shown its efficacy on the problems of optimization of chemical engineering.
Author supplied keywords
Cite
CITATION STYLE
Naruka, B., Sharma, T. K., Pant, M., Sharma, S., & Rajpurohit, J. (2015). Differential shuffled frog-leaping algorithm. In Advances in Intelligent Systems and Computing (Vol. 336, pp. 245–253). Springer Verlag. https://doi.org/10.1007/978-81-322-2220-0_20
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.