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

Saad Alharbi and Ibrahim Venkat

Journal of Optimization, 2017, vol. 2017, 1-8

Abstract:

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.

Date: 2017
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://downloads.hindawi.com/journals/7179/2017/5650364.pdf (application/pdf)
http://downloads.hindawi.com/journals/7179/2017/5650364.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jjopti:5650364

DOI: 10.1155/2017/5650364

Access Statistics for this article

More articles in Journal of Optimization from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().