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
Heuristics Applied to Minimization of the Maximum-Diameter Clustering Problem
Sign Up to like & getrecommendations! Published in 2021 at "IEEE Latin America Transactions"
DOI: 10.1109/tla.2021.9448548
Abstract: This paper introduces two heuristic algorithms for the Maximum-Diameter Clustering Problem (MDCP), based on the Biased Random-Key Genetic Algorithm (BRKGA) and the Greedy Randomized Adaptive Search Procedure (GRASP) metaheuristics. This problem consists of finding k… read more here.
Keywords: diameter; maximum diameter; problem; clustering problem ... See more keywords
A Randomized Algorithm for a Sequence 2-Clustering Problem
Sign Up to like & getrecommendations! Published in 2018 at "Computational Mathematics and Mathematical Physics"
DOI: 10.1134/s0965542518120138
Abstract: We consider a strongly NP-hard problem of partitioning a finite Euclidean sequence into two clusters of given cardinalities minimizing the sum over both clusters of intracluster sums of squared distances from clusters elements to their… read more here.
Keywords: sequence clustering; randomized algorithm; algorithm sequence; clustering problem ... 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