Dynamic multi-swarm particle swarm optimizer with harmony search

Authors:
S. -Z. Zhao;P. N. Suganthan;Quan-Ke Pan;M. Fatih Tasgetiren
Affiliations:
School of Electrical and Electronic Engineering, Nanyang Technological University, Singapore 639798, Singapore;School of Electrical and Electronic Engineering, Nanyang Technological University, Singapore 639798, Singapore;College of Computer Science, Liaocheng University, Liaocheng 252059, PR China;Department of Industrial Engineering, Yasar University, Bornova, Izmir, Turkey
Venue:
Expert Systems with Applications: An International Journal
Year:
2011

Citing 3
Cited 5

The particle swarm - explosion, stability, and convergence in amultidimensional complex space

IEEE Transactions on Evolutionary Computation
A Cooperative approach to particle swarm optimization

IEEE Transactions on Evolutionary Computation
Comprehensive learning particle swarm optimizer for global optimization of multimodal functions

IEEE Transactions on Evolutionary Computation

Harmony search with differential mutation based pitch adjustment

Proceedings of the 13th annual conference on Genetic and evolutionary computation
An Intelligent Tuned Harmony Search algorithm for optimisation

Information Sciences: an International Journal
Nurse rostering using modified harmony search algorithm

SEMCCO'11 Proceedings of the Second international conference on Swarm, Evolutionary, and Memetic Computing - Volume Part II
Improved PSO algorithm with harmony search for complicated function optimization problems

ISNN'12 Proceedings of the 9th international conference on Advances in Neural Networks - Volume Part I
An improved adaptive binary Harmony Search algorithm

Information Sciences: an International Journal

Quantified Score

Hi-index	12.05

Visualization

Abstract

In this paper, the dynamic multi-swarm particle swarm optimizer (DMS-PSO) is improved by hybridizing it with the harmony search (HS) algorithm and the resulting algorithm is abbreviated as DMS-PSO-HS. We present a novel approach to merge the HS algorithm into each sub-swarm of the DMS-PSO. Combining the exploration capabilities of the DMS-PSO and the stochastic exploitation of the HS, the DMS-PSO-HS is developed. The whole DMS-PSO population is divided into a large number of small and dynamic sub-swarms which are also individual HS populations. These sub-swarms are regrouped frequently and information is exchanged among the particles in the whole swarm. The DMS-PSO-HS demonstrates improved on multimodal and composition test problems when compared with the DMS-PSO and the HS.