Murdoch University Research Repository

Welcome to the Murdoch University Research Repository

The Murdoch University Research Repository is an open access digital collection of research
created by Murdoch University staff, researchers and postgraduate students.

Learn more

An efficient hybrid evolutionary optimization algorithm based on PSO and SA for clustering

Niknam, T., Amiri, B., Olamaei, J. and Arefi, A.ORCID: 0000-0001-9642-7639 (2009) An efficient hybrid evolutionary optimization algorithm based on PSO and SA for clustering. Journal of Zhejiang University-SCIENCE A, 10 (4). pp. 512-519.

Link to Published Version:
*Subscription may be required


The K-means algorithm is one of the most popular techniques in clustering. Nevertheless, the performance of the K-means algorithm depends highly on initial cluster centers and converges to local minima. This paper proposes a hybrid evolutionary programming based clustering algorithm, called PSO-SA, by combining particle swarm optimization (PSO) and simulated annealing (SA). The basic idea is to search around the global solution by SA and to increase the information exchange among particles using a mutation operator to escape local optima. Three datasets, Iris, Wisconsin Breast Cancer, and Ripley’s Glass, have been considered to show the effectiveness of the proposed clustering algorithm in providing optimal clusters. The simulation results show that the PSO-SA clustering algorithm not only has a better response but also converges more quickly than the K-means, PSO, and SA algorithms.

Item Type: Journal Article
Publisher: Zhejiang University Press
Copyright: © Zhejiang University and Springer-Verlag GmbH 2009
Item Control Page Item Control Page