Multi-start methods for the capacitated clustering problem

Martinez-Gavara, Anna and Campos, Vicente and 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.

[img]
Preview
PDF - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
Download (104kB) | Preview

Abstract

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.

Item Type: Conference or Workshop Item (Paper)
Additional Information: Published in: Metaheuristics: Proceeding of the MIC and MAEB 2017 Conferences, 4-7 July 2017, Barcelona, Spain, p. 926-928. Universitat Pompeu Fabra. ISBN: 978-84-697-4275-1.
Schools/Departments: University of Nottingham, UK > Faculty of Science > School of Computer Science
Related URLs:
Depositing User: Landa-Silva, Dario
Date Deposited: 11 Aug 2017 09:22
Last Modified: 11 Aug 2017 11:42
URI: http://eprints.nottingham.ac.uk/id/eprint/44823

Actions (Archive Staff Only)

Edit View Edit View