Please use this identifier to cite or link to this item:
Title: Compound particle swarm optimization in dynamic environments
Authors: Liu, L
Wang, D
Yang, S
Keywords: Dynamic optimization problems;Compound particle swarm optimization;Evolutionary algorithms;Compound particles
Issue Date: 2008
Publisher: Springer
Citation: EvoWorkshops 2008: Applications of Evolutionary Computing, Lecture Notes in Computer Science 4974: 616 - 625, 2008
Abstract: Adaptation to dynamic optimization problems is currently receiving a growing interest as one of the most important applications of evolutionary algorithms. In this paper, a compound particle swarm optimization (CPSO) is proposed as a new variant of particle swarm optimization to enhance its performance in dynamic environments. Within CPSO, compound particles are constructed as a novel type of particles in the search space and their motions are integrated into the swarm. A special reflection scheme is introduced in order to explore the search space more comprehensively. Furthermore, some information preserving and anti-convergence strategies are also developed to improve the performance of CPSO in a new environment. An experimental study shows the efficiency of CPSO in dynamic environments.
Description: Copyright @ Springer-Verlag Berlin Heidelberg 2008.
ISSN: 0302-9743
Appears in Collections:Publications
Computer Science
Dept of Computer Science Research Papers

Files in This Item:
File Description SizeFormat 
Fulltext.pdf153.54 kBAdobe PDFView/Open

Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.