Triggered memoir swarm optimization in dynamic environments

ISSN: 03029743
57Citations
Citations of this article
19Readers
Mendeley users who have this article in their library.

Abstract

In recent years, there has been an increasing concern from the evolutionary computation community on dynamic optimization problems since many real-world optimization problems are time-varying. In this paper, a triggered memory scheme is introduced into the particle swarm optimization to deal with dynamic environments. The triggered memory scheme enhances traditional memory scheme with a triggered memory generator. Experimental study over a benchmark dynamic problem shows that the triggered memory-based particle swarm optimization algorithm has stronger robustness and adaptability than traditional particle swarm optimization algorithms, both with and without traditional memory scheme, for dynamic optimization problems. © Springer-Verlag Berlin Heidelberg 2007.

Cite

CITATION STYLE

APA

Wang, H., Wang, D., & Yang, S. (2007). Triggered memoir swarm optimization in dynamic environments. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4448 LNCS, pp. 637–646).

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