A BRKGA Heuristic for the Problem of Covering Sets with Conflicts Between Sets

In this work, we explore a variant of the Set Covering Problem, which presents
conflicts between subsets. If two conflicting subsets are selected for a
solution, a certain penalty will be paid. An algorithm that uses a heuristic of the type
Biased Random-Key Genetic Algorithm (BKGA), which works in an iterative manner, applying
Several techniques based on concepts of biology will be developed with the objective of delivering
good quality solutions to the problem, that is, solutions of low associated cost. The variant
of the BRKGA adopted is the island model, which works with multiple populations that, in principle,
evolve in isolation and later the algorithm performs exchanges of individuals between them a
in order to promote genetic diversity.