Fixed Set Search Applied to the Maximum Disjoint Dominating Sets Problem

In this paper the fixed set search (FSS), a population-based metaheuristic, is applied to the Maximum Disjoint Dominating Sets Problem (MDDSP). Initially, a greedy randomized adaptive search procedure (GRASP) is developed to solve the MDDSP. Subsequently, the FSS enhances GRASP by incorporating a learning mechanism that identifies common elements in high-quality solutions. Computational experiments show that the proposed method significantly outperforms current state-of-the-art methods.