3-SAT Using Island-based Genetic Algorithm

カテゴリ: 国際会議

論文No: MS7-4

グループ名: ACIS2015

発行日: 2015/10/15

著者名(英語): Salmah Mousbah Zeed Mohammed(Unversiti Sains Malaysia), Ahamad Tajudin Khader(Unversiti Sains Malaysia), Mohammed Azmi Al-Betar(Al-Balqa Applied University)

キーワード: Island model concept, Genetic algorithm, 3-SAT problem

要約(英語): The Boolean Satisfiability Problem (SAT), which is know as a three-conjunctive normal form, is an expression where every clause consists of three literals but with an unrestricted number of literals and clauses. This study implemented the island model genetic algorithm (Island-based GA) to solve the 3-SAT problem. The benchmark SAT problems of four suits (URSAT1, URSAT2, URSAT3, and URSAT4) in SATLIB were used to test the performance of the Island-based GA and were compared with MAEA-SAT and Standard GA (SGA). The Island-based GA obtained good results and performance in solving large-scale SAT problems.

原稿種別: 英語

PDFファイルサイズ: 793 Kバイト