Multi-start methods for the capacitated clustering problem
In this work, we investigate the adaptation of the Greedy Randomized Adaptive Search Procedure (GRASP) and Iterated Greedy methodologies to the Capacitated Clustering Problem (CCP). In particular, we focus on the effect of the balance between randomization and greediness on the performance of these...
| Main Authors: | , , , |
|---|---|
| Format: | Conference or Workshop Item |
| Published: |
2017
|
| Online Access: | https://eprints.nottingham.ac.uk/44823/ |
| _version_ | 1848797005880492032 |
|---|---|
| author | Martinez-Gavara, Anna Campos, Vicente Landa-Silva, Dario Marti, Rafael |
| author_facet | Martinez-Gavara, Anna Campos, Vicente Landa-Silva, Dario Marti, Rafael |
| author_sort | Martinez-Gavara, Anna |
| building | Nottingham Research Data Repository |
| collection | Online Access |
| description | In this work, we investigate the adaptation of the Greedy Randomized Adaptive Search Procedure (GRASP) and Iterated Greedy methodologies to the Capacitated Clustering Problem (CCP). In particular, we focus on the effect of the balance between randomization and greediness on the performance of these multi-start heuristic search methods when solving this NP-hard problem. The former is a memory-less approach that constructs independent solutions, while the latter is a memory-based method that constructs linked solutions, obtained by partially rebuilding previous ones. Both are based on the combination of greediness and randomization in the constructive process, and coupled with a subsequent local search phase. |
| first_indexed | 2025-11-14T19:57:00Z |
| format | Conference or Workshop Item |
| id | nottingham-44823 |
| institution | University of Nottingham Malaysia Campus |
| institution_category | Local University |
| last_indexed | 2025-11-14T19:57:00Z |
| publishDate | 2017 |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | nottingham-448232020-05-04T18:54:14Z https://eprints.nottingham.ac.uk/44823/ Multi-start methods for the capacitated clustering problem Martinez-Gavara, Anna Campos, Vicente Landa-Silva, Dario Marti, Rafael In this work, we investigate the adaptation of the Greedy Randomized Adaptive Search Procedure (GRASP) and Iterated Greedy methodologies to the Capacitated Clustering Problem (CCP). In particular, we focus on the effect of the balance between randomization and greediness on the performance of these multi-start heuristic search methods when solving this NP-hard problem. The former is a memory-less approach that constructs independent solutions, while the latter is a memory-based method that constructs linked solutions, obtained by partially rebuilding previous ones. Both are based on the combination of greediness and randomization in the constructive process, and coupled with a subsequent local search phase. 2017-07-04 Conference or Workshop Item PeerReviewed Martinez-Gavara, Anna, Campos, Vicente, Landa-Silva, Dario and Marti, Rafael (2017) Multi-start methods for the capacitated clustering problem. In: 12th Metaheuristics International Conference (MIC 2017), 4-7 July 2017, Barcelona, Spain. |
| spellingShingle | Martinez-Gavara, Anna Campos, Vicente Landa-Silva, Dario Marti, Rafael Multi-start methods for the capacitated clustering problem |
| title | Multi-start methods for the capacitated clustering problem |
| title_full | Multi-start methods for the capacitated clustering problem |
| title_fullStr | Multi-start methods for the capacitated clustering problem |
| title_full_unstemmed | Multi-start methods for the capacitated clustering problem |
| title_short | Multi-start methods for the capacitated clustering problem |
| title_sort | multi-start methods for the capacitated clustering problem |
| url | https://eprints.nottingham.ac.uk/44823/ |