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
Capacitated Clustering via Majorization-Minimization and Collaborative Neurodynamic Optimization.
Sign Up to like & getrecommendations! Published in 2022 at "IEEE transactions on neural networks and learning systems"
DOI: 10.1109/tnnls.2022.3212593
Abstract: This paper addresses capacitated clustering based on majorization-minimization and collaborative neurodynamic optimization (CNO). Capacitated clustering is formulated as a combinatorial optimization problem. Its objective function consists of fractional terms with intra-cluster similarities in their numerators… read more here.
Keywords: minimization collaborative; optimization; majorization minimization; capacitated clustering ... See more keywords
HA-CCP: A Hybrid Algorithm for Solving Capacitated Clustering Problem
Sign Up to like & getrecommendations! Published in 2022 at "Computational Intelligence and Neuroscience"
DOI: 10.1155/2022/6400318
Abstract: The capacitated clustering problem (CCP) divides the vertices of the undirected graph into several disjoint clusters so that the sum of the node weights in each cluster meets the capacity limit while maximizing the sum… read more here.
Keywords: problem; clustering problem; hybrid algorithm; capacitated clustering ... See more keywords