Table of Contents Author Guidelines Submit a Manuscript
Journal of Optimization
Volume 2017, Article ID 5650364, 8 pages
Research Article

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

1Computer Science Department, Taibah University, Medina, Saudi Arabia
2School of Computer Sciences, Universiti Sains Malaysia, Penang, Malaysia

Correspondence should be addressed to Saad Alharbi; moc.liamg@02ibrahlas

Received 20 February 2017; Revised 24 April 2017; Accepted 3 May 2017; Published 4 June 2017

Academic Editor: Gexiang Zhang

Copyright © 2017 Saad Alharbi and Ibrahim Venkat. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


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.