An Effective VNS Algorithm for k-Medoids Clustering Problem
José André de Moura Brito, Gustavo Silva Semaan, Augusto Cesar Fadel · IEEE Latin America Transactions · 2022
This paper proposes an algorithm based on VNS metaheuristcs for k-medoids clustering, which is a NP-hard optimization problem. The VNS algorithm was applied in fifty data bases (instances) with small, medium, and large sizes, considering the number of clusters between 2 and 7. The obtained results from these experiments show the effectiveness of this approach, comparing it with nine other related clustering algorithms and an optimization formulation. Furthermore, we found that our algorithm obtained the optimal solutions for the vast majority of the cases.