Filters








19 Hits in 2.1 sec

The satisfiability problem [chapter]

2006 Phase Transitions in Combinatorial Optimization Problems  
This paper presents GASAT, a hybrid algorithm for the satisfiability problem (SAT). This algorithm includes a recombination stage based on a specific crossover and a tabu search stage.  ...  An experimental evaluation of the different components of GASAT and a general comparison with state-of-the-art SAT algorithms are proposed.  ...  We would like to thank the referees of the paper for their useful comments and Claudio Rossi who has provided us with the FlipGA source code.  ... 
doi:10.1002/3527606734.ch10 fatcat:6x2j7iougjfsljwl7jiwgusqwy

Boundary Evolution Algorithm for SAT-NP [article]

Zhaoyang Ai, Chaodong Fan, Yingjie Zhang, Huigui Rong, Ze'an Tian, Haibing Fu
2018 arXiv   pre-print
Based on the numerous versions of genetic algorithm, the boundary evolution approach with crossover and mutation has been tested on the SAT problem and compared with two competing methods: a traditional  ...  A boundary evolution Algorithm (BEA) is proposed by simultaneously taking into account the bottom and the high-level crossover and mutation, ie., the boundary of the hierarchical genetic algorithm.  ...  Brys T. (2013) solves the satisfiability problem of fuzzy logic by using the local search and restarting strategy.  ... 
arXiv:1903.01894v1 fatcat:t76ktwf3jzc6xnpl5ifsnihioi

Bees Swarm Optimization Metaheuristic Guided by Decomposition for Solving MAX-SAT

Youcef Djenouri, Zineb Habbas, Wassila Aggoune-Mtalaa
2016 Proceedings of the 8th International Conference on Agents and Artificial Intelligence  
More pragmatically, this paper deals with the MAX-SAT problem and uses the Kmeans algorithm as a decomposition method.  ...  More recently, Tree decomposition has been successfully used to guide the Variable Neighbor Search (VNS) local search method.  ...  Comparison of the GASAT and the Hybrid BSO-MAXSAT Algorithms As mentioned in section 1, in GASAT, a simple local search is added at the end of the Genetic Algorithm to improve the quality of the final  ... 
doi:10.5220/0005810004720479 dblp:conf/icaart/DjenouriHA16 fatcat:gwacj4gxffeftcda3x2n7cfg6u

Gases Brownian Motion Optimization: an Algorithm for Optimization (GBMO)

Marjan Abdechiri, Mohammad Reza Meybodi, Helena Bahrami
2013 Applied Soft Computing  
As a more recent developed meta-heuristic algorithm, the Charged System Search (CSS) has been introduced for design of structural problems [10].  ...  Different EAs have been developed for optimization which among them we can point to the Genetic Algorithm (GA) proposed by Holland [2] and inspired by the biological evolutionary process.  ...  The performance of GASAT is best SATWAGA because GASAT uses the local search algorithm (Tabu search).  ... 
doi:10.1016/j.asoc.2012.03.068 fatcat:xy5csrcaiza4ri4quggj4dy36u

3-SAT Problem A New Memetic-PSO Algorithm [article]

Nasser Lotfi, Jamshid Tamouk, Mina Farmanbar
2013 arXiv   pre-print
This paper presents a new hybrid evolutionary algorithm for solving this satisfiability problem. 3-SAT problem has the huge search space and hence it is known as a NP-hard problem.  ...  In this paper, we introduce a new evolutionary optimization technique based on PSO, Memetic algorithm and local search approaches.  ...  This paper presents a new hybrid evolutionary algorithm for solving this satisfiability problem. 3-SAT problem has the huge search space and it is a NP-hard problem [1] .  ... 
arXiv:1306.5070v1 fatcat:kqgfbw5w45glrgbr6qs4rpk2iu

A Multilevel Approach Applied to Sat-Encoded Problems [chapter]

Noureddine Bouhmala
2012 VLSI Design  
Unlike local search methods that work on a current single solution, evolutionary approaches evolve a set of solutions. GASAT (21)(24) is considered to be the best known genetic algorithm for SAT.  ...  MAs represent the set of hybrid algorithms that combine genetic algorithms and local search. In general the genetic algorithm improves the solution while the local search fine tunes the solution.  ...  analysis of large analog circuits on GPU platforms, Algorithms for CAD tools VLSI design, A multilevel memetic algorithm for large SAT-encoded problems, etc.  ... 
doi:10.5772/33436 fatcat:gvld7j3aczc7riyhc77vetuoy4

Combining An Evolutionary Algorithm With The Multilevel Paradigm For The Simulation Of Complex System

Noureddine Bouhmala, Karina Hjelmervik, Kjell Ivar Overgard
2013 ECMS 2013 Proceedings edited by: Webjorn Rekdalsbakken, Robin T. Bye, Houxiang Zhang  
Algorithms for Solving SAT: A survey Family of GSAT One of the earliest local search algorithms for solving SAT is GSAT[42].  ...  The satisfiabiltiy problem refers to the task of finding a satisfying assignment that makes a Boolean expression evaluate to True.  ...  GASAT [23] [29] is considered to be the best known genetic algorithm for SAT. GASAT is a hybrid algorithm that combines a specific crossover and a tabu search procedure.  ... 
doi:10.7148/2013-0753 dblp:conf/ecms/BouhmalaHO13 fatcat:55dwrzz3czaz3mtuti6j6a63dm

A Hybrid Quantum Genetic Algorithm and Local Search based DPLL for Max 3-SAT Problems

Abdesslem Layeb, Djamel-Eddine Saidouni
2014 Applied Mathematics & Information Sciences  
A new local search based on DPLL algorithm has been embodied in the quantum genetic algorithm leading to an efficient hybrid framework which achieves better balance between diversification and intensification  ...  The underlying idea is to harness the optimization capabilities of quantum genetic algorithm to achieve good quality solutions for Max SAT problem.  ...  Recently, several memetic algorithms were proposed to deal with the Max Sat problems for example: FlipGA [9] based on hybrid genetic algorithm and a special flip heuristics; GASAT [8] based on hybrid  ... 
doi:10.12785/amis/080109 fatcat:qmyh7erwejaovbuaxp4xe4gohi

Automated Discovery of Local Search Heuristics for Satisfiability Testing

Alex S. Fukunaga
2008 Evolutionary Computation  
The development of successful metaheuristic algorithms such as local search for a difficult problems such as satisfiability testing (SAT) is a challenging task.  ...  Based on this observation, we developed CLASS, a genetic programming system that uses a simple composition operator to automatically discover SAT local search heuristics.  ...  Acknowledgments Thanks to Rich Korf and Jason Fama for helpful discussions, and Jim Clune for helpful comments on a draft of this paper.  ... 
doi:10.1162/evco.2008.16.1.31 pmid:18386995 fatcat:2xtt63nr7nf3lolz7lzgg4qosq

GA-EDA: Hybrid Evolutionary Algorithm Using Genetic and Estimation of Distribution Algorithms [chapter]

J. M. Peña, V. Robles, P. Larrañaga, V. Herves, F. Rosales, M. S. Pérez
2004 Lecture Notes in Computer Science  
In this paper we present a new approach, named GA-EDA, which is a new hybrid algorithm based on genetic and estimation of distribution algorithms.  ...  In order to perform an evaluation of this new approach a selection of synthetic optimizations problems have been proposed together with two realworld cases.  ...  The authors would like to acknowledge Raquel Hernández for her work programming and testing the first stages of this algorithm, as well as her useful comments.  ... 
doi:10.1007/978-3-540-24677-0_38 fatcat:xgghqsqnrzh3zledty3brc5tiq

A Clonal Selection Algorithm Based Tabu Search for Satisfiability Problems

Abdesslem Layeb
2012 Journal of Advances in Information Technology  
We present in this paper a new memetic algorithm to deal with the Max Sat problem.  ...  A local search based on Tabu Search has been embodied in the clonal selection algorithm leading to an efficient hybrid framework which achieves better balance between exploration and exploitation capabilities  ...  Recently, several memetic algorithms were proposed to deal with the Max Sat problems for example: FlipGA [11] based on hybrid genetic algorithm and a special flip heuristics; GASAT [12] based on hybrid  ... 
doi:10.4304/jait.3.2.138-146 fatcat:k7dk33lonnhkbptxsxynasvske

An Experimental Study of Adaptive Control for Evolutionary Algorithms [article]

Giacomo di Tollo and Frédéric Lardeux and Jorge Maturana and Frédéric Saubion
2014 arXiv   pre-print
The balance of exploration versus exploitation (EvE) is a key issue on evolutionary computation.  ...  In this paper we will investigate how an adaptive controller aimed to perform Operator Selection can be used to dynamically manage the EvE balance required by the search, showing that the search strategies  ...  To this aim we have chosen to tackle the satisfiability problem (SAT) (Biere et al., 2009) for two main reasons.  ... 
arXiv:1409.1715v1 fatcat:lilom74fgvh57gvth4rcrmfvme

A team of pursuit learning automata for solving deterministic optimization problems

Anis Yazidi, Nourredine Bouhmala, Morten Goodwin
2020 Applied intelligence (Boston)  
We provide some experimental results that show how our Pursuit-LA scheme can be used to solve the Maximum Satisfiability (Max-SAT) problem.  ...  The distinguishing characteristic of automata-based learning is that the search for an optimal parameter (or decision) is conducted in the space of probability distributions defined over the parameter  ...  The nature-inspired GASAT algorithm [72] is a hybrid algorithm that combines a specific crossover and a tabu search procedure.  ... 
doi:10.1007/s10489-020-01657-9 fatcat:gb6yvu2nj5dw7on453brkeuspq

A multilevel synergy Thompson sampling hyper-heuristic for solving Max-SAT

Mourad Lassouaoui, Dalila Boughaci, Belaid Benhamou
2019 International Journal of Intelligent Decision Technologies  
Selection hyper-heuristics evaluate low-level heuristics and determine which of them to be applied at a given point in the search process.  ...  Moreover they haven't been tested on large NP-hard problems. In this work, we propose a new hyper-heuristic which we called the Multilevel Synergy Thompson Sampling Hyper-Heuristic.  ...  , 109 the scatter search algorithm [17], the genetic algo-110 rithm [17-19], the GASAT algorithm [20], the nov-111 elty method [21], the adaptnovelty method [22], the 112 guided local search method  ... 
doi:10.3233/idt-180036 fatcat:ad3mg4gl25e27ghesqe3phjuc4

Evolutionary and Swarm Computing for the Semantic Web

Christophe Gueret, Stefan Schlobach, Kathrin Dentler, Martijn Schut, Gusz Eiben
2012 IEEE Computational Intelligence Magazine  
Finally, we will discuss two case studies in which we successfully applied soft computing methods to two of the main reasoning tasks; an evolutionary approach to querying, and a swarm algorithm for entailment  ...  The Semantic Web has become a dynamic and enormous network of typed links between data sets stored on different machines.  ...  These specific constraints are a hiccup for algorithms that require having a local copy of the data they operate on.  ... 
doi:10.1109/mci.2012.2188583 fatcat:5guizi4b2nbhjmdhopyqwlev74
« Previous Showing results 1 — 15 out of 19 results