Integração de heurísticas lagrangeanas com algoritmos exatos para a otimização de particionamento de conjuntos

• Autor(a) principal: Alves, Alexsandro de Oliveira
• Data de Publicação: 2007
• Tipo de documento: Dissertação
• Idioma: por
• Título da fonte: Repositório Institucional da Universidade Federal do Ceará (UFC)
• Texto Completo: http://www.repositorio.ufc.br/handle/riufc/16938
• topic: Ciência da computação; Particionamento de conjuntos; Busca tabu; Heurísticas lagrangeanas; Método do subgradiente; Branch and bound; Set partitioning; Tabu Search; Lagrangian heuristics; Subgradient method; Branch and bound

In this work we evaluate both exact and heuristic methods for the set partitioning problem (SPP). These heuristics are based on greedy algorithms, tabu search and subgradient optimization. Computational experiments performed on benchmark instances of the problem indicate that our heuristics are competitive with existing ones from the literature in obtaining both lower and upper bounds of good quality in reasonable execution time. We use a Branch and Bound algorithm that allows to prove optimality of solutions obtained by our heuristics for a large set of benchmark instances of the SPP. Thus, we show that our heuristics are efficient in obtaining feasible solutions of good quality for this problem.