Clustering search
This paper presents the Clustering Search (CS) as a new hybrid metaheuristic, which works in conjunction with other metaheuristics, managing the implementation of local search algorithms for optimization problems. Usually the local search is costly and should be used only in promising regions of the search space. The CS assists in the discovery of these regions by dividing the search space into clusters. The CS and its applications are reviewed and a case study for a problem of capacitated clustering is presented.
Saved in:
Main Authors: | , , |
---|---|
Format: | Digital revista |
Language: | English |
Published: |
Sociedade Brasileira de Pesquisa Operacional
2013
|
Online Access: | http://old.scielo.br/scielo.php?script=sci_arttext&pid=S0101-74382013000100007 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Summary: | This paper presents the Clustering Search (CS) as a new hybrid metaheuristic, which works in conjunction with other metaheuristics, managing the implementation of local search algorithms for optimization problems. Usually the local search is costly and should be used only in promising regions of the search space. The CS assists in the discovery of these regions by dividing the search space into clusters. The CS and its applications are reviewed and a case study for a problem of capacitated clustering is presented. |
---|