Heurísticas para o problema leasing k-center

Abstract

The k-center problem is a well known combinatorial optimization problem. This text presents a generalization of this problem, known as leasing k-center. In this text we present the leasing k-center problem formally and informally, as well as the main concepts involved. Possible applications are also presented. We show that the k-center problem is extensively worked on literature and several approaches have been proposed over the years to solve it and so we also states that the problem leasing k-center has relevance. We believe that the problem leasing k-center was not worked with computational experiments, so this conclusion of course work takes the purpose to serve as a basis to future works of the area. Here we propose a formulation on Linear Programming, a heuristic based on the metaheuristic BRKGA and another heuristic based on the metaheuristic Local Search to obtain solutions for the leasing k-center, as well as we compare these algorithms experimentally.