A Memetic Approach for Classic Minimum Dominating Set Problem.

Solving the minimum dominating set problem is an NP-hard problem, which cannot be solved in a polynomial time. In this paper, a memetic algorithm is proposed to solve the minimum dominating set problem. We transform the original problem into a sequence of decision problems, i.e., the k-dominating set problem. The algorithm tackling the k-dominating set problem consists of a local search process embedded in a genetic optimization framework. As an optimization algorithm with a parallel structure, the memetic algorithm speeds up the convergence speed and improves the solution efficiency. The results from the memetic algorithm are compared with those of other algorithms, showing that the memetic algorithm is better.