A cellular genetic algorithm for satisfiability problems

被引:0
|
作者
Pizzuti, C
Spezzano, G
Ursino, D
机构
来源
关键词
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
This paper presents a new evolutionary method for the satisfiability problem based on a cellular genetic algorithm. In this method a global search on a random initial population of individuals is performed by local selective generation of new strings according to new defined genetic operators, The algorithm adopts a diffusion model of information among chromosomes by realizing a one-dimensional cellular automata in which the neighborhood relation is based on a fixed variable radius. Furthermore, the cellular algorithm is suitable for a direct parallel implementation.
引用
收藏
页码:408 / 413
页数:6
相关论文
共 50 条
  • [1] Solving the satisfiability problem by a parallel cellular genetic algorithm
    Folino, G
    Pizzuti, C
    Spezzano, G
    [J]. 24TH EUROMICRO CONFERENCE - PROCEEDING, VOLS 1 AND 2, 1998, : 715 - 722
  • [2] An Enhanced Fuzzy-Genetic Algorithm to Solve Satisfiability Problems
    Francisco, Jose
    Villamizar, Saray
    Badr, Youakim
    Abraharn, Ajith
    [J]. UKSIM 2009: ELEVENTH INTERNATIONAL CONFERENCE ON COMPUTER MODELLING AND SIMULATION, 2009, : 77 - 82
  • [3] Combining cellular genetic algorithms and local search for solving satisfiability problems
    Folino, G
    Pizzuti, C
    Spezzano, G
    [J]. TENTH IEEE INTERNATIONAL CONFERENCE ON TOOLS WITH ARTIFICIAL INTELLIGENCE, PROCEEDINGS, 1998, : 192 - 198
  • [4] A NN algorithm for Boolean satisfiability problems
    Spears, WM
    [J]. ICNN - 1996 IEEE INTERNATIONAL CONFERENCE ON NEURAL NETWORKS, VOLS. 1-4, 1996, : 1121 - 1126
  • [5] A genetic algorithm for layout problems in cellular manufacturing systems
    Kulkarni, Prafulla C.
    Shanker, Kripa
    [J]. 2007 IEEE INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND ENGINEERING MANAGEMENT, VOLS 1-4, 2007, : 694 - +
  • [6] GASAT: A genetic local search algorithm for the satisfiability problem
    Lardeux, Frederic
    Saubion, Frederic
    Hao, Jin-Kao
    [J]. EVOLUTIONARY COMPUTATION, 2006, 14 (02) : 223 - 253
  • [7] Cellular Genetic Algorithm with Communicating Grids for Assembly Line Balancing Problems
    Brudaru, Octav
    Popovici, Diana
    Copaceanu, Cintia
    [J]. ADVANCES IN ELECTRICAL AND COMPUTER ENGINEERING, 2010, 10 (02) : 87 - 93
  • [8] Exponential complexity of the quantum adiabatic algorithm for certain satisfiability problems
    Hen, Itay
    Young, A. P.
    [J]. PHYSICAL REVIEW E, 2011, 84 (06):
  • [9] A minimal-state processing search algorithm for satisfiability problems
    Funabiki, N
    Yokohira, T
    Nakanishi, T
    Tajima, S
    Higashino, T
    [J]. 2001 IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN, AND CYBERNETICS, VOLS 1-5: E-SYSTEMS AND E-MAN FOR CYBERNETICS IN CYBERSPACE, 2002, : 2769 - 2774
  • [10] An average case analysis of the branching algorithm for solving κ-satisfiability problems
    Tsai, YT
    Tang, CY
    [J]. PROCEEDINGS OF THE 4TH AUSTRALASIAN THEORY SYMPOSIUM, CATS'98, 1998, 20 (03): : 137 - 150