Recombinative CLA-EC

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 whic...

Full description

Saved in:
Bibliographic Details
Main Authors: Jafarpour, B., Meybodi, M.R.
Format: Conference Proceeding
Language:English
Subjects:
Biological cells
Cells (biology)
Evolutionary computation
Genetic algorithms
Genetic mutations
Learning automata
Mathematical model
Pediatrics
Space exploration
Testing
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:1082-3409
2375-0197
DOI:10.1109/ICTAI.2007.35