A coevolutionary memetic particle swarm optimizer

N/ACitations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper presents a coevolutionary memetic particle swarm optimizer (CMPSO) for the global optimization of numerical functions. CMPSO simplifies the update rules of the global evolution and utilizes five different effective local search strategies for individual improvement. The combination of the local search strategy and its corresponding computational budget is defined as coevolutionary meme (CM). CMPSO co-evolves both CMs and a single particle position recording the historical best solution that is optimized by the CMs in each generation. The experimental results on 7 unimodal and 22 multimodal benchmark functions demonstrate that CMPSO obtains better performance than other representative state-of-the-art PSO variances. Particularly, CMPSO is shown to have higher convergence speed. © 2012 Springer-Verlag.

Cite

CITATION STYLE

APA

Zhou, J., Ji, Z., Zhu, Z., & Chen, S. (2012). A coevolutionary memetic particle swarm optimizer. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7331 LNCS, pp. 91–100). https://doi.org/10.1007/978-3-642-30976-2_11

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free