Tabu-KM: A Hybrid Clustering Algorithm Based on Tabu Search Approach
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 hybri...
Main Authors: | N.Ghazanfari, M. Yaghini |
---|---|
Format: | Article |
Language: | English |
Published: |
Iran University of Science & Technology
2010-09-01
|
Series: | International Journal of Industrial Engineering and Production Research |
Subjects: | |
Online Access: | http://ijiepr.iust.ac.ir/article-A-10-94-7-1-en.html |
Similar Items
-
Tabu-KM: A Hybrid Clustering Algorithm Based on Tabu Search Approach
by: M. Yaghini, et al.
Published: (2010-05-01) -
An efficient tabu search algorithm for the linear ordering problem
by: Masahiro SAKABE, et al.
Published: (2022-10-01) -
GATeS: A Hybrid Algorithm Based on Genetic Algorithm and Tabu Search for the Direct Marketing Problem
by: Felipe Martins Muller, et al.
Published: (2024-01-01) -
Analysis of usage of genetic and tabu search algorithms in shop scheduling
by: Edgaras Šakurovas, et al.
Published: (2008-12-01) -
Tabu Search and Memetic Algorithms for a Real Scheduling and Routing Problem
by: Anass El-Yaakoubi, et al.
Published: (2017-11-01)