Solving the capacitated clustering problem with variable neighborhood search

DOI10.1007/s10479-017-2601-5zbMath1409.90155OpenAlexW2742664076MaRDI QIDQ1730629

Dragan Urošević, Nenad Mladenović, Jack Brimberg, Raca Todosijević

Publication date: 6 March 2019

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-017-2601-5

zbMATH Keywords

optimizationclusteringlocal searchheuristic

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items

A matheuristic for large-scale capacitated clustering, Neighborhood decomposition-driven variable neighborhood search for capacitated clustering, A review on discrete diversity and dispersion maximization from an OR perspective, Capacitated clustering problems applied to the layout of IT-teams in software factories, Resilient route design for collection of material from suppliers with split deliveries and stochastic demands, Less is more approach: basic variable neighborhood search for the obnoxious p‐median problem, Revenue maximization of Internet of things provider using variable neighbourhood search

Cites Work

• A reactive GRASP with path relinking for capacitated clustering
• Tabu search and GRASP for the maximum diversity problem
• Tabu search and GRASP for the capacitated clustering problem
• Attraction probabilities in variable neighborhood search
• Solving the clique partitioning problem as a maximally diverse grouping problem
• An artificial bee colony algorithm for the maximally diverse grouping problem
• Variable neighborhood search for maximum diverse grouping problem
• Variable Neighborhood Descent for the Capacitated Clustering Problem