Solving the capacitated clustering problem with variable neighborhood search
- 249 Downloads
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.
KeywordsOptimization Clustering Heuristic Local search
The research has been supported in part by Research Grants 174010 and III 044006 of the Serbian Ministry of Education, Science and Technological Development, and a Natural Sciences and Engineering Research Council of Canada Discovery Grant (NSERC #205041-2014).
- Brimberg, J., Janićijević, S., Mladenović, N., & Urošević, D. (2015a). Solving the clique partitioning problem as a maximally diverse grouping problem. Optimization Letters, 1–13. doi: 10.1007/s11590-015-0869-4.