Investigação de algoritmos híbridos para o problema da Árvore Geradora Multiobjetivo

Abstract

The Multi-objective Spanning Tree Problem (MSTP) is an extension of the Minimum Spanning Tree Problem. The Minimum Spanning Tree Problem considers only one objective, however, many real applications can be modeled by the inclusion of more objectives, which must be optimized simultaneously, for such applications there is a need to solve the MSTP. Several approaches have been proposed by many authors, such as exact and heuristic algorithms. This work presents techniques of hybridization of exact and metaheuristic methods to solve the MSTP, as well as proposes new algorithms that use such techniques of hybridization. In this work, comparisons are also made between existing algorithms in the literature and new proposed algorithms.