A novel memetic algorithm for global optimization based on PSO and SFLA

Authors:
Ziyang Zhen;Zhisheng Wang;Zhou Gu;Yuanyuan Liu
Affiliations:
College of Automation Engineering, Nanjing University of Aeronautics and Astronautics, Nanjing, China;College of Automation Engineering, Nanjing University of Aeronautics and Astronautics, Nanjing, China;College of Power Engineering, Nanjing Normal University, Nanjing, China;College of Automation Engineering, Nanjing University of Aeronautics and Astronautics, Nanjing, China
Venue:
ISICA'07 Proceedings of the 2nd international conference on Advances in computation and intelligence
Year:
2007

Citing 3
Cited 3

Shuffled complex evolution approach for effective and efficient global minimization

Journal of Optimization Theory and Applications
Parameter Selection in Particle Swarm Optimization

EP '98 Proceedings of the 7th International Conference on Evolutionary Programming VII
Ant system: optimization by a colony of cooperating agents

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics

Improved particle swarm optimizer based on adaptive random learning approach

CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
Improved shuffled frog leaping algorithm for continuous optimization problem

CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
A design automation system for CMOS analog integrated circuits using New Hybrid Shuffled Frog Leaping Algorithm

Microelectronics Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

Memetic algorithms (MAs) which mimic culture evolution are population based heuristic searching approaches for the optimization problems. This paper presents a new memetic algorithm called shuffled particle swarm optimization (SPSO), which combines the learning strategy of particle swarm optimization (PSO) and the shuffle strategy of shuffled frog leaping algorithm (SFLA). In the proposed algorithm, the population is partitioned into several memeplexes according to the performance, and the memotypes in each memeplex evolve according to the self-learning and the learning from the best memotype of the memeplex. Furthermore, the memeplexes are shuffled and separated again to continue the evolutionary process. The combination approach contributes to the local exploration and the global exploration of SPSO. Experimental studies on the continuous parametric benchmark problems show the robustness and the global convergence property of the proposed memetic algorithm.