Solving the capacitated clustering problem with variable neighborhood search
Sign Up to like & getrecommendations! Published in 2019 at "Annals of Operations Research"
DOI: 10.1007/s10479-017-2601-5
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… read more here.
Keywords: capacitated clustering; clustering problem; solving capacitated; variable neighborhood ... See more keywords