Heuristica e metaheuristicas para o problema de agrupamento capacitado

AUTOR(ES)

Nelida Gladys Maquera Sosa

DATA DE PUBLICAÇÃO

1996

RESUMO

Clustering techniques can be applied aiming different purposes with applications in severa! fields of science. In the Capacitated Clustering Problem (CCP) objects with distinct weights must be partitioned into clusters with limited capacity. It is presented four constructive heuristics that use weights and distances as optimization criteria. An improvement heuristic that performs insertions and interchanges of objects and a single Tabu Search (TS) application is also proposed. Moreover, it is applied an adaptive mechanism (HTA) based on TS which joins both intensifying and diversifying phases during the search. Computational tests show that HTA attains good quality solutions independent1y from the starting solution. They also show that a!gorithms based on object weights perform better than the ones based on distances. The same methodology is applied to a Political Districting Problem (PDP) which is a particular case of CCP. A preliminary study on the districting of Campinas city has shown that districting plans can be obtained with very reasonable errors

ASSUNTO(S)

analise por conglomerados otimização combinatoria distritos eleitorais heuristica

Documentos Relacionados

• Metaheurísticas para o problema de agrupamento de dados em grafo
• Metaheurísticas para as variantes do problema de roteamento de veículos: capacitado, com janela de tempo e com tempo de viagem estocástico
• Uma meta-heurística de busca decomposta em vizinhança variável para o problema bidimensional de agrupamento de entregas em veículos de uma frota heterogênea
• DESENVOLVIMENTO DE METAHEURÍSTICAS PARA O PROBLEMA DA ÁRVORE GERADORA MÍNIMA GENERALIZADO
• Uma abordagem heurística para o problema de otimização de distrito postal