Volume 21, Number 2 (IJIEPR 2010)                   IJIEPR 2010, 21(2): 71-79 | Back to browse issues page


XML Print


Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:

Yaghini M, Ghazanfari N. Tabu-KM: A Hybrid Clustering Algorithm Based on Tabu Search Approach. IJIEPR. 2010; 21 (2) :71-79
URL: http://ijiepr.iust.ac.ir/article-1-195-en.html

, yaghini@iust.ac.ir
Abstract:   (6010 Views)

  The clustering problem under the criterion of minimum sum of squares is a non-convex and non-linear program, which possesses many locally optimal values, resulting that its solution often falls into these trap and therefore cannot converge to global optima solution. In this paper, an efficient hybrid optimization algorithm is developed for solving this problem, called Tabu-KM. It gathers the optimization property of tabu search and the local search capability of k-means algorithm together. The contribution of proposed algorithm is to produce tabu space for escaping from the trap of local optima and finding better solutions effectively. The Tabu-KM algorithm is tested on several simulated and standard datasets and its performance is compared with k-means, simulated annealing, tabu search, genetic algorithm, and ant colony optimization algorithms. The experimental results on simulated and standard test problems denote the robustness and efficiency of the algorithm and confirm that the proposed method is a suitable choice for solving data clustering problems.

Full-Text [PDF 373 kb]   (2496 Downloads)    
Type of Study: Research | Subject: Other Related Subject
Received: 2010/11/22

Add your comments about this article : Your username or email:
Write the security code in the box

Send email to the article author


© 2015 All Rights Reserved | International Journal of Industrial Engineering & Production Research

Designed & Developed by : Yektaweb