Please use this identifier to cite or link to this item:
Title: A memetic particle swarm optimisation algorithm for dynamic multi-modal optimisation problems
Authors: Wang, H
Yang, S
Ip, WH
Wang, D
Keywords: Memetic computing;Memetic algorithm;Particle swarm optimisation;Dynamic multi-modal optimisation problem;Speciation;Local search
Issue Date: 2011
Publisher: Taylor and Francis
Citation: International Journal of Systems Science, 43(7): 1268-1283, 2011
Abstract: Many real-world optimisation problems are both dynamic and multi-modal, which require an optimisation algorithm not only to find as many optima under a specific environment as possible, but also to track their moving trajectory over dynamic environments. To address this requirement, this article investigates a memetic computing approach based on particle swarm optimisation for dynamic multi-modal optimisation problems (DMMOPs). Within the framework of the proposed algorithm, a new speciation method is employed to locate and track multiple peaks and an adaptive local search method is also hybridised to accelerate the exploitation of species generated by the speciation method. In addition, a memory-based re-initialisation scheme is introduced into the proposed algorithm in order to further enhance its performance in dynamic multi-modal environments. Based on the moving peaks benchmark problems, experiments are carried out to investigate the performance of the proposed algorithm in comparison with several state-of-the-art algorithms taken from the literature. The experimental results show the efficiency of the proposed algorithm for DMMOPs.
Description: Copyright @ 2011 Taylor & Francis.
ISSN: 0020-7721
Appears in Collections:Publications
Computer Science
Dept of Computer Science Research Papers

Files in This Item:
File Description SizeFormat 
Fulltext.pdf227.02 kBAdobe PDFView/Open

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