Implementação e avaliação de algoritmos genéticos para o problema da máxima intersecção de k Subconjuntos utilizando o framework PYMOO: estudo exploratório

Abstract

In this work, we propose the implementation and evaluation of genetic algorithms for solving the Maximum Intersection of k-Subsets (kMIS) problem using the PyMoo framework. The kMIS problem consists of given a collection L = {S1,...,Sn} of n subsets over a finite set of elements R={e1,...,em}, and a positive integer k, the goal is to select exactly k subsets belonging to L, such that the intersection of these subsets is maximized. Through the PyMoo framework, we explore different genetic algorithm techniques, optimizing the search for the maximum intersection with a focus on the effectiveness and efficiency of the solutions generated.