A Genetic Algorithm Based Approach for Solving the Minimum Dominating Set of Queens Problem

الملخص EN

In the field of computing, combinatorics, and related areas, researchers have formulated several techniques for the Minimum Dominating Set of Queens Problem (MDSQP) pertaining to the typical chessboard based puzzles.

However, literature shows that limited research has been carried out to solve the MDSQP using bioinspired algorithms.

To fill this gap, this paper proposes a simple and effective solution based on genetic algorithms to solve this classical problem.

We report results which demonstrate that near optimal solutions have been determined by the GA for different board sizes ranging from 8 × 8 to 11 × 11.