M. Yaghini - Faculty of School of Railway Engineering, Iran University of Science and Technology
N. Ghazanfari - E-Learning Center-Iran University of Science and Technology

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 solutionseffectively. 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 obustness and efficiency of the algorithm and confirm that the proposed method is a suitable choice for solving data clustering problems.

Clustering problem, Hybrid algorithm, Tabu search algorithm, k-Means algorithm