The Experimental Analysis of the Efficiency of Genetic Algorithm Based on 3-satisfiability Problem

被引:0
|
作者
Zhang, Yu-an [1 ]
Li, Bingfen [2 ]
Meng, Qiao [1 ]
Hu, Qiongqiong [1 ]
Ma, Qinglian [3 ,4 ]
机构
[1] Qinghai Univ, Dept Comp Technol & Applicat, Xining 810016, Peoples R China
[2] Qinghai Univ, Inst Engn Mech, Xining 810016, Peoples R China
[3] Miyazaki Univ, Interdisciplinary Grad Sch Agr & Engn, Miyazaki 8892192, Japan
[4] Qinghai Engn Invest Inst, Xining 810008, Peoples R China
关键词
genetic algorithms; satisfiability problem; success probability;
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Genetic algorithm is widely used to solve the satisfiability problem in recent years. However, it still suffers from premature convergence and loss of precise. With bubble sort combining dichotomy selection, we studied 3-SAT problem on genetic algorithm. We used C++ programming language to simulate the algorithm. In this paper, we evaluated the computational efficiency of the genetic operators and related parameters on the genetic algorithm. A larger number of experiments were conducted. The results showed that the success probability S with crossover is larger than that of without crossover. Crossover plays an important role on S. The performance of the genetic algorithm arises as the variables and population size increases. When the population size is larger, the effect of variables on success probability is stronger. Meanwhile, there are some connection between the success probability S and the the generation of the first hitting G. When the mutation rate P-m <= 0.1, the curve of P-m-dependence of 1/G is similar to the P-m-dependence of S.
引用
收藏
页码:245 / 249
页数:5
相关论文
共 50 条
  • [1] Study of computational performance of Genetic Algorithm for 3-satisfiability problem
    Ma, QingLian
    Zhang, Yu-an
    Sakamoto, Makoto
    Furutani, Hiroshi
    [J]. PROCEEDINGS OF THE SIXTEENTH INTERNATIONAL SYMPOSIUM ON ARTIFICIAL LIFE AND ROBOTICS (AROB 16TH '11), 2011, : 354 - 358
  • [2] AN EFFICIENT ALGORITHM FOR THE 3-SATISFIABILITY PROBLEM
    BILLIONNET, A
    SUTTER, A
    [J]. OPERATIONS RESEARCH LETTERS, 1992, 12 (01) : 29 - 36
  • [3] The Empirical Study of the Schema Theory of Genetic Algorithm Based on 3-satisfiability Problem
    Zhang YuAn
    Li BingFen
    [J]. PROCEEDINGS OF THE 2015 JOINT INTERNATIONAL MECHANICAL, ELECTRONIC AND INFORMATION TECHNOLOGY CONFERENCE (JIMET 2015), 2015, 10 : 448 - 453
  • [4] ISSATA: An algorithm for solving the 3-satisfiability problem based on improved strategy
    Guo, Ping
    Zhang, Yang
    [J]. APPLIED INTELLIGENCE, 2022, 52 (02) : 1740 - 1751
  • [5] ISSATA: An algorithm for solving the 3-satisfiability problem based on improved strategy
    Ping Guo
    Yang Zhang
    [J]. Applied Intelligence, 2022, 52 : 1740 - 1751
  • [6] PROBABILISTIC ANALYSIS OF 2 HEURISTICS FOR THE 3-SATISFIABILITY PROBLEM
    CHAO, MT
    FRANCO, J
    [J]. SIAM JOURNAL ON COMPUTING, 1986, 15 (04) : 1106 - 1118
  • [7] A NEURAL NETWORK APPROACH TO THE 3-SATISFIABILITY PROBLEM
    JOHNSON, JL
    [J]. JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 1989, 6 (02) : 435 - 449
  • [8] Solving the 3-Satisfiability Problem Using Network-Based Biocomputation
    Zhu, Jingyuan
    Salhotra, Aseem
    Meinecke, Christoph Robert
    Surendiran, Pradheebha
    Lyttleton, Roman
    Reuter, Danny
    Kugler, Hillel
    Diez, Stefan
    Mansson, Alf
    Linke, Heiner
    Korten, Till
    [J]. ADVANCED INTELLIGENT SYSTEMS, 2022, 4 (12)
  • [9] Hybridised Network of Fuzzy Logic and a Genetic Algorithm in Solving 3-Satisfiability Hopfield Neural Networks
    Azizan, Farah Liyana
    Sathasivam, Saratha
    Ali, Majid Khan Majahar
    Roslan, Nurshazneem
    Feng, Caicai
    [J]. AXIOMS, 2023, 12 (03)
  • [10] On the Communication Complexity of the Vertex Cover Problem and 3-Satisfiability Problem in ECP Systems
    Hernandez, Nestine Hope S.
    Juayong, Richelle Ann B.
    Francia, Sherlyne L.
    Francisco, Denise Alyssa A.
    Adorna, Henry N.
    [J]. MEMBRANE COMPUTING (CMC 2015), 2015, 9504 : 200 - 214