By Topic

Recombinative CLA-EC

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

2 Author(s)
Jafarpour, B. ; Amirkabir Univ. of Technol., Tehran ; Meybodi, M.R.

Cellular learning automata (CLA) which is obtained by combining cellular automata (CA) and learning automata (LA) models is a mathematical model for dynamical complex systems that consists of a large number of simple learning components. CLA- EC, introduced recently is an evolutionary algorithm which is obtained by combining CLA and evolutionary computation (EC). In this paper CLA-EC with recombination operator is introduced. Recombination increases explorative behavior of CLA-EC and also provides a mechanism for partial structure exchange between chromosomes of population individuals that standard CLA-EC is not capable of performing it. This modification greatly improves CLA-EC ability to effectively search solution space and leave local optima. Experimental results on five optimization test functions show the superiority of this new version of CLA-EC over the standard CLA-EC.

Published in:

Tools with Artificial Intelligence, 2007. ICTAI 2007. 19th IEEE International Conference on  (Volume:1 )

Date of Conference:

29-31 Oct. 2007