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

摘要

In the field of computing, combinatorics, and related areas, researchers have formulated several techniques for the MinimumudDominating Set of Queens Problem (MDSQP) pertaining to the typical chessboard based puzzles. However, literature shows thatudlimited research has been carried out to solve theMDSQP using bioinspired algorithms. To fill this gap, this paper proposes a simpleudand effective solution based on genetic algorithms to solve this classical problem. We report results which demonstrate that nearudoptimal solutions have been determined by the GA for different board sizes ranging from 8 × 8 to 11 × 11.