Controlling particle trajectories in a multi-swarm approach for dynamic optimization problems

11Citations
Citations of this article
10Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In recent years, particle swarm optimization has emerged as a suitable optimization technique for dynamic environments, mainly its multi-swarm variant. However, in the search for good solutions some particles may produce transitions between non improving ones. Although this fact is usual in stochastic algorithms like PSO, when the problem at hand is dynamic in some sense one can consider that those particles are wasting resources (evaluations, time, etc). To overcome this problem, a novel operator for controlling particle trajectories is introduced into a multi-swarm PSO algorithm. Experimental studies over a benchmark problem shows the benefits of the proposal. © 2009 Springer Berlin Heidelberg.

Cite

CITATION STYLE

APA

Novoa, P., Pelta, D. A., Cruz, C., & Del Amo, I. G. (2009). Controlling particle trajectories in a multi-swarm approach for dynamic optimization problems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5601 LNCS, pp. 285–294). https://doi.org/10.1007/978-3-642-02264-7_30

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