SOLVING THE 3-SAT PROBLEM USING GENETIC ALGORITHMS

被引：0
|
作者：
Loviskova, Jana [1 ]
机构：
[1] Inst Informat SAS, Dept Modeling & Control Discrete Proc, Bratislava, Slovakia
来源：
INES 2015 - IEEE 19TH INTERNATIONAL CONFERENCE ON INTELLIGENT ENGINEERING SYSTEMS | 2015年
关键词：
NP-complete problem; 3-SAT problem; back-tracking; local searching; genetic algorithm (GA); stepwise adaptation of weights (SAW);
D O I：
暂无
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
The goal of the article is to compare efficiency of solving a problem of determining satisfiability of logical formulas SAT (3-SAT), which belongs to a class of NP-complete problems, either by using simple genetic algorithms or using genetic algorithms with suggested modified mechanism of stepwise adaptation of weights (SAW). Two possible ways of dealing with constraint - either based on a penalization or based on a remuneration are compared here. It is shown, on the basis of repeated and evaluated experiments, that a genetic algorithm with suggested mechanism of stepwise adaptation of weights (SAW) is much more efficient for solving the 3-SAT problem.
引用
收藏
页码：207 / 212
页数：6
相关论文
共 50 条
  • [41] Solving relative reduction problem using genetic algorithms
    Tao, Z
    Xu, BD
    Zhao, CY
    SERVICE SYSTEMS AND SERVICE MANAGEMENT - PROCEEDINGS OF ICSSSM '04, VOLS 1 AND 2, 2004, : 650 - 654
  • [42] Solving timetabling problem using genetic and heuristic algorithms
    Thanh, Nguyen Duc
    SNPD 2007: EIGHTH ACIS INTERNATIONAL CONFERENCE ON SOFTWARE ENGINEERING, ARTIFICIAL INTELLIGENCE, NETWORKING, AND PARALLEL/DISTRIBUTED COMPUTING, VOL 3, PROCEEDINGS, 2007, : 472 - 477
  • [43] Solving the Mountain Car Problem Using Genetic Algorithms
    Badica, Amelia
    Badica, Costin
    Buligiu, Ion
    Ciora, Liviu Ion
    Ganzha, Maria
    Paprzycki, Marcin
    LARGE-SCALE SCIENTIFIC COMPUTATIONS, LSSC 2023, 2024, 13952 : 237 - 245
  • [44] Solving wood collection problem using genetic algorithms
    Karanta, I
    Mikkola, T
    Bounsaythip, C
    Jokinen, O
    Savola, J
    GECCO-99: PROCEEDINGS OF THE GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE, 1999, : 1787 - 1787
  • [45] Using genetic algorithms for solving partitioning problem in codesign
    Koudil, M
    Benatchba, K
    Dours, D
    ARTIFICIAL NEURAL NETS PROBLEM SOLVING METHODS, PT II, 2003, 2687 : 393 - 400
  • [46] Solving graph partitioning problem using genetic algorithms
    Shazely, S
    Baraka, H
    Abdel-Wahab, A
    1998 MIDWEST SYMPOSIUM ON CIRCUITS AND SYSTEMS, PROCEEDINGS, 1999, : 302 - 305
  • [47] Solving timetable scheduling problem using genetic algorithms
    Sigl, B
    Golub, M
    Mornar, V
    ITI 2003: PROCEEDINGS OF THE 25TH INTERNATIONAL CONFERENCE ON INFORMATION TECHNOLOGY INTERFACES, 2003, : 519 - 524
  • [48] Solution of a 20-variable 3-SAT problem on a DNA computer
    Braich, RS
    Chelyapov, N
    Johnson, C
    Rothemund, PWK
    Adleman, L
    SCIENCE, 2002, 296 (5567) : 499 - 502
  • [49] Automating the DNA computer: Solving n-variable 3-SAT problems
    Johnson, Clifford R.
    DNA COMPUTING, 2006, 4287 : 360 - 373
  • [50] Automating the DNA computer: solving n-Variable 3-SAT problems
    Clifford R. Johnson
    Natural Computing, 2008, 7 (2) : 239 - 253
12345