Improvement strategies for multi-swarm PSO in dynamic environments

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

Abstract

Many real world optimization problems are dynamic, meaning that their optimal solutions are time-varying. In recent years, an effective approach to address these problems has been the multi-swarmPSO (mPSO). Despite this, we believe that there is still room for improvement and, in this contribution we propose two simple strategies to increase the effectiveness of mPSO. The first one faces the diversity loss in the swarm after an environment change; while the second one increases the efficiency through stopping swarms showing a bad behavior. From the experiments performed on the Moving Peaks Benchmark, we have confirmed the benefits of our strategies. © 2010 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Novoa-Hernández, P., Pelta, D. A., & Corona, C. C. (2010). Improvement strategies for multi-swarm PSO in dynamic environments. In Studies in Computational Intelligence (Vol. 284, pp. 371–383). https://doi.org/10.1007/978-3-642-12538-6_31

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