Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
10347342 | Computers & Operations Research | 2005 | 11 Pages |
Abstract
A metaheuristic procedure based on the scatter search approach is proposed for the non-hierarchical clustering problem under the criterion of minimum sum-of-squares clustering. This algorithm incorporates procedures based on different strategies, such as local search, GRASP, tabu search or path relinking. The aim is to obtain quality solutions with short computation times. A series of computational experiments has been performed. The proposed algorithm obtains better results than previously reported methods, especially with small numbers of clusters.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
JoaquıÌn A. Pacheco,