Brunel University Research Archive (BURA) >
University >
Publications >

Please use this identifier to cite or link to this item: http://bura.brunel.ac.uk/handle/2438/6010

Title: A general framework of multi-population methods with clustering in undetectable dynamic environments
Authors: Li, C
Yang, S
Keywords: Clustering
Dynamic optimization problem
Undetectable dynamism
Multiple population methods
Particle swarm optimization
Genetic algorithm
Differential evolution
Publication Date: 2011
Publisher: IEEE
Citation: IEEE Transactions on Evolutionary Computation, Forthcoming 2011
Abstract: To solve dynamic optimization problems, multiple population methods are used to enhance the population diversity for an algorithm with the aim of maintaining multiple populations in different sub-areas in the fitness landscape. Many experimental studies have shown that locating and tracking multiple relatively good optima rather than a single global optimum is an effective idea in dynamic environments. However, several challenges need to be addressed when multi-population methods are applied, e.g., how to create multiple populations, how to maintain them in different sub-areas, and how to deal with the situation where changes can not be detected or predicted. To address these issues, this paper investigates a hierarchical clustering method to locate and track multiple optima for dynamic optimization problems. To deal with undetectable dynamic environments, this paper applies the random immigrants method without change detection based on a mechanism that can automatically reduce redundant individuals in the search space throughout the run. These methods are implemented into several research areas, including particle swarm optimization, genetic algorithm, and differential evolution. An experimental study is conducted based on the moving peaks benchmark to test the performance with several other algorithms from the literature. The experimental results show the efficiency of the clustering method for locating and tracking multiple optima in comparison with other algorithms based on multi-population methods on the moving peaks benchmark.
Description: Copyright @ 2011 IEEE
URI: http://bura.brunel.ac.uk/handle/2438/6010
DOI: http://dx.doi.org/10.1109/TEVC.2011.2169966
ISSN: 1089-778X
Appears in Collections:School of Information Systems, Computing and Mathematics Research Papers
Publications
Computer Science

Files in This Item:

File Description SizeFormat
Fulltext.pdf347.36 kBAdobe PDFView/Open

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

 


Library (c) Brunel University.    Powered By: DSpace
Send us your
Feedback. Last Updated: September 14, 2010.
Managed by:
Hassan Bhuiyan