Scheduled System Maintenance on May 29th, 2015:
IEEE Xplore will be upgraded between 11:00 AM and 10:00 PM EDT. During this time there may be intermittent impact on performance. We apologize for any inconvenience.
By Topic

A Clonal Selection Based Shuffled Frog Leaping Algorithm

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Bhaduri, A. ;

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.

Published in:

Advance Computing Conference, 2009. IACC 2009. IEEE International

Date of Conference:

6-7 March 2009