Local and Variable Neighborhood Searches for Solving the Capacitated Clustering Problem

Jack Brimberg (), Nenad Mladenović (), Raca Todosijević () and Dragan Urošević ()
Additional contact information
Jack Brimberg: Royal Military College of Canada
Nenad Mladenović: Mathematical Institute SANU
Raca Todosijević: Mathematical Institute SANU
Dragan Urošević: Mathematical Institute SANU

A chapter in Optimization Methods and Applications, 2017, pp 33-55 from Springer

Abstract: Abstract The capacitated clustering problem requires finding a partition of a given set of elements with associated positive weights into a specified number of groups (or clusters) so that the sum of diversities of the individual clusters is maximized and the sum of weights of the elements in each cluster is within some capacity limits. We examine here various neighborhood structures for conducting local search for this type of problem and then describe a powerful variable neighborhood descent (VND) that employs three of these neighborhoods in a deterministic fashion and has appeared recently in the literature as a stand-alone heuristic. We then examine some recently developed heuristics for solving the problem that are based on variable neighborhood search (VNS), including a new one that applies a recently proposed variant of VNS known as nested VNS. These heuristics all use the prescribed VND in their local improvement step. A summary is given of extensive computational tests that demonstrate the effectiveness of these VNS-based heuristics over the state of the art.

Keywords: Variable Neighborhood Search (VNS); Capacitated Clustering Problem (CCP); Variable Neighborhood Descent (VND); Local Improvement Step; Greedy Randomized Adaptive Search Procedure (GRASP) (search for similar items in EconPapers)
Date: 2017
References: Add references at CitEc
Citations: View citations in EconPapers (1)

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:spochp:978-3-319-68640-0_3

Ordering information: This item can be ordered from
http://www.springer.com/9783319686400

DOI: 10.1007/978-3-319-68640-0_3

Access Statistics for this chapter

More chapters in Springer Optimization and Its Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().