Improved Frog Leaping Algorithm Using Cellular Learning Automata

In this paper, a new algorithm which is the result of combination of cellular learning automata (CLA) and shuffled frog leap algorithm (SFLA) is proposed for optimization of functions in continuous, staticenvironments. In the frog leaping algorithm, every frog represents a feasible solution within theproblem space. In the proposed algorithm, each memeplex of frogs is placed in a cell of CLA. Learning automata in each cell acts as the brain of memeplex and will determine the strategy of motion and search.The proposed algorithm along with the standard SFLA and two global and local versions ofparticle swarm optimization algorithm have been tested in 30-dimensional space on five standard merit functions. Experimental results show that the proposed algorithm has a performance of the introduced algorithm is due to the control of search behavior of frogs during the optimization process

کلیدواژه ها:

Frog Leaping Algorithm ، Optimization ، Cellular Learning Automata