Skip to Main content Skip to Navigation
Journal articles

Solving the Capacitated Clustering Problem with Variable Neighborhood Search

Abstract : Variable neighborhood search (VNS) is a proven heuristic framework for finding good solutions to combinatorial and global optimization problems. In this paper two VNS-based heuristics are proposed for solving the capacitated clustering problem. The first follows a standard VNS approach, and the second a skewed VNS that allows moves to inferior solutions. The performance of the two heuristics is assessed on benchmark instances from the literature. We also compare their performance against a recently published iterated VNS procedure. All VNS procedures outperform the state-of-the-art, but the Skewed VNS is best overall. This would suggest that using acceptance criteria before allowing moves to inferior solutions in Skewed VNS is preferable to the random shaking approach that is used in Iterated VNS to move to new regions of the solution space.
Document type :
Journal articles
Complete list of metadata
Contributor : Aurélien Vicentini Connect in order to contact the contributor
Submitted on : Wednesday, February 23, 2022 - 2:16:32 PM
Last modification on : Thursday, September 1, 2022 - 9:52:54 AM




Jack Brimberg, Nenad Mladenovic, Raca Todosijević, Dragan Urošević. Solving the Capacitated Clustering Problem with Variable Neighborhood Search. Annals of Operations Research, Springer Verlag, 2019, 272 (2), pp.289-321. ⟨10.1007/s10479-017-2601-5⟩. ⟨hal-03585829⟩



Record views