Abstract
This paper presents a biased random-key genetic algorithm for k-medoids clustering problem. A novel heuristic operator was implemented and combined with a parallelized local search procedure. Experiments were carried out with fifty literature data sets with small, medium, and large sizes, considering several numbers of clusters, showed that the proposed algorithm outperformed eight other algorithms, for example, the classics PAM and CLARA algorithms. Furthermore, with the results of a linear integer programming formulation, we found that our algorithm obtained the global optimal solutions for most cases and, despite its stochastic nature, presented stability in terms of quality of the solutions obtained and the number of generations required to produce such solutions. In addition, considering the solutions (clusterings) produced by the algorithms, a relative validation index (average silhouette) was applied, where, again, was observed that our method performed well, producing cluster with a good structure.
Subject
Management Science and Operations Research,Computer Science Applications,Theoretical Computer Science
Reference56 articles.
1. Aloise D. and Contardo C., A new global optimization algorithm for diameter minimization clusteringIn: Proceedings of Global Optimization Workshop (GOW16), Portugal, edited by Aloise D.. University of Minho/Algoritmi Research Centre. (2016) 171–174.
2. On the efficiency of evolutionary fuzzy clustering
3. Daskin M., Network and Discrete Location: Models, Algorithms, and Applications, 2nd edition. John Wiley & Sons (2013).
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献