A swarm intelligence approach to minimum weight independent dominating set problem

The minimum weight independent dominating set (MWIDS) problem is a challenging problem in graph theory with diverse practical applications. In this paper, we propose a novel approach to tackle the MWIDS problem efficiently using the Artificial Bee Colony (ABC) algorithm, a metaheuristic optimization technique inspired by the foraging behavior of honeybees. Our approach integrates six heuristics tailored as per the characteristics of the MWIDS problem within the ABC algorithm to generate high-quality solutions by effectively exploring the solution space. We have conducted extensive experiments on standard benchmark instances to evaluate the effectiveness of our proposed approach. The experimental results demonstrate the competitiveness of our approach in comparison to the state-of-the-art for finding high quality solutions highlighting its potential for practical applications in real-world scenarios.