DocumentCode
3072312
Title
A Clonal Selection Based Shuffled Frog Leaping Algorithm
Author
Bhaduri, Antariksha
Author_Institution
antobhaduri@gmail.com
fYear
2009
fDate
6-7 March 2009
Firstpage
125
Lastpage
130
Abstract
The shuffled frog leaping algorithm (SFLA) is a recent meta-heuristic memetic algorithm used for optimization having a simple algorithm with a fast calculation time. It mimics the social behavior of a species (frogs) found in nature. Clonal selection algorithm (CSA) is an optimization algorithm developed based on the processes occurring in natural immune system. In this paper, a novel algorithm is proposed that is based on a modified CSA and SFLA. In the proposed algorithm a modified CSA is used for the best candidates in the population to progress and SFLA for the worst candidates in the population to move towards the best candidates. The power of the algorithm lies in the fact that it avoids stagnation and has a very fast convergence speed. The algorithm is tested against SFLA for five functions in which it greatly outperforms SFLA in terms of convergence rate and the optimum result obtained.
Keywords
artificial immune systems; genetic algorithms; clonal selection algorithm; frog social behavior; genetic algorithm; meta-heuristic memetic algorithm; natural immune system; optimization algorithm; shuffled frog leaping algorithm; Computational complexity; Convergence; Genetics; Heuristic algorithms; Immune system; Input variables; Particle swarm optimization; Polynomials; Testing;
fLanguage
English
Publisher
ieee
Conference_Titel
Advance Computing Conference, 2009. IACC 2009. IEEE International
Conference_Location
Patiala
Print_ISBN
978-1-4244-2927-1
Electronic_ISBN
978-1-4244-2928-8
Type
conf
DOI
10.1109/IADCC.2009.4808993
Filename
4808993
Link To Document