A MULTI START HEURISTIC BASED ON GRASP FOR AN AUTOMATIC CLUSTERING PROBLEM

  • Marcelo Dib Cruz Universidade Federal Rural do Rio de Janeiro UFRRJ
  • Luiz Satoru Ochi Universidade Federal Fluminense

Resumo

Clustering is the process by which elements of a database are assigned to clusters of similar elements. In clustering algorithms, it is usually assumed that the number of clusters is known. Unfortunately, the optimal number of clusters is unknown for many applications. These problems are known as Automatic Clustering Problems (ACP). In this work we present a new multi start heuristic based in GRASP for ACP including two local search operators and path relinking procedure. Computational results on a set of instances illustrate the effectiveness and the robustness of the proposed heuristic.

Biografia do Autor

Marcelo Dib Cruz, Universidade Federal Rural do Rio de Janeiro UFRRJ

Departamento de Matematica - Area de Computacao

Trabalha com otimizacao combinatoria, especificamente com Metaheuristicas e aplicacoes

Publicado
07-12-2015
Como Citar
Cruz, M., & Ochi, L. (2015). A MULTI START HEURISTIC BASED ON GRASP FOR AN AUTOMATIC CLUSTERING PROBLEM. Pesquisa Operacional Para O Desenvolvimento, 7(2), 130-146. Recuperado de https://podesenvolvimento.org.br/podesenvolvimento/article/view/356
Seção
Artigos