Multi-start methods for the capacitated clustering problemTools 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. Full text not available from this repository.AbstractIn 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.
Actions (Archive Staff Only)
|
Tools
Tools
