A Quantum Genetic Algorithm with Hill Climbing Algorithm for Max 3-sat Problems
نویسندگان
چکیده
In this paper we present a new iterative method to solve the maximum satisfiability problem (MAX SAT). This one aims to find the best assignment for a set of Boolean variables that gives the maximum of verified clauses in a Boolean formula. Unfortunately, It is shown that the MAX SAT problem is NP complete if the number of variable per clause is higher than 3. Our approach called QHILLSAT is a combination of a Quantum Genetic Algorithm QGA and a Hill Climbing Algorithm. The main features of this algorithm consist in the quantum structure used to represent MAX SAT solutions and the quantum operators defining the overall evolutionary dynamic of the genetic algorithm. The Hill Climbing Search procedure is used in order to increase the efficiency of the exploration process. Experiments on wide range of data sets have shown the effectiveness of the proposed framework and its ability to achieve good quality solutions.
منابع مشابه
A Proposed Improved Hybrid Hill Climbing Algorithm with the Capability of Local Search for Solving the Nonlinear Economic Load Dispatch Problem
This paper introduces a new hybrid hill-climbing algorithm (HHC) for solving the Economic Dispatch (ED) problem. This algorithm solves the ED problems with a systematic search structure with a global search. It improves the results obtained from an evolutionary algorithm with local search and converges to the best possible solution that grabs the accuracy of the problem. The most important goal...
متن کاملThe COMPSET Algorithm for Subset Selection
Subset selection problems are relevant in many domains. Unfortunately, their combinatorial nature prohibits solving them optimally in most cases. Local search algorithms have been applied to subset selection with varying degrees of success. This work presents COMPSET, a general algorithm for subset selection that invokes an existing local search algorithm from a random subset and its complement...
متن کاملBQIABC: A new Quantum-Inspired Artificial Bee Colony Algorithm for Binary Optimization Problems
Artificial bee colony (ABC) algorithm is a swarm intelligence optimization algorithm inspired by the intelligent behavior of honey bees when searching for food sources. The various versions of the ABC algorithm have been widely used to solve continuous and discrete optimization problems in different fields. In this paper a new binary version of the ABC algorithm inspired by quantum computing, c...
متن کاملA Hybrid Quantum Genetic Algorithm and Local Search based DPLL for Max 3-SAT Problems
In this paper, we present a new framework for combining complete and incomplete methods in order to deal with the Max Sat problem. The objective is to find the best assignment for a set of Boolean variables, which gives the maximum of verified clauses in a Boolean formula. Unfortunately, this problem has been shown to be NP-hard (non-deterministic polynomial-time hard) if the number of variable...
متن کاملRESOLUTION OF NONLINEAR OPTIMIZATION PROBLEMS SUBJECT TO BIPOLAR MAX-MIN FUZZY RELATION EQUATION CONSTRAINTS USING GENETIC ALGORITHM
This paper studies the nonlinear optimization problems subject to bipolar max-min fuzzy relation equation constraints. The feasible solution set of the problems is non-convex, in a general case. Therefore, conventional nonlinear optimization methods cannot be ideal for resolution of such problems. Hence, a Genetic Algorithm (GA) is proposed to find their optimal solution. This algorithm uses th...
متن کامل