A Genetic Algorithm Based Approach for Solving the Minimum Dominating Set of Queens Problem
Joint Authors
Source
Issue
Vol. 2017, Issue 2017 (31 Dec. 2017), pp.1-8, 8 p.
Publisher
Hindawi Publishing Corporation
Publication Date
2017-06-04
Country of Publication
Egypt
No. of Pages
8
Main Subjects
Abstract 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.
American Psychological Association (APA)
Alharbi, Saad& Venkat, Ibrahim. 2017. A Genetic Algorithm Based Approach for Solving the Minimum Dominating Set of Queens Problem. Journal of Optimization،Vol. 2017, no. 2017, pp.1-8.
https://search.emarefa.net/detail/BIM-1185927
Modern Language Association (MLA)
Alharbi, Saad& Venkat, Ibrahim. A Genetic Algorithm Based Approach for Solving the Minimum Dominating Set of Queens Problem. Journal of Optimization No. 2017 (2017), pp.1-8.
https://search.emarefa.net/detail/BIM-1185927
American Medical Association (AMA)
Alharbi, Saad& Venkat, Ibrahim. A Genetic Algorithm Based Approach for Solving the Minimum Dominating Set of Queens Problem. Journal of Optimization. 2017. Vol. 2017, no. 2017, pp.1-8.
https://search.emarefa.net/detail/BIM-1185927
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references
Record ID
BIM-1185927