A New Quantum Evolutionary Local Search Algorithm for MAX 3-SAT Problem

Authors:
Abdesslem Layeb;Djamel-Eddine Saidouni
Affiliations:
Lire laboratory, infography group, University Mentouri of Constantine, Algeria;Lire laboratory, infography group, University Mentouri of Constantine, Algeria
Venue:
HAIS '08 Proceedings of the 3rd international workshop on Hybrid Artificial Intelligence Systems
Year:
2008

Citing 6
Cited 4

Explorations in quantum computing

Explorations in quantum computing
GRASP: A Search Algorithm for Propositional Satisfiability

IEEE Transactions on Computers
Local Search Algorithms for SAT: An Empirical Evaluation

Journal of Automated Reasoning
The complexity of theorem-proving procedures

STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Multiple sequence alignment by quantum genetic algorithm

IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Quantum-inspired evolutionary algorithms with a new termination criterion, Hε gate, and two-phase scheme

IEEE Transactions on Evolutionary Computation

A new artificial immune system for solving the maximum satisfiability problem

IEA/AIE'10 Proceedings of the 23rd international conference on Industrial engineering and other applications of applied intelligent systems - Volume Part II
A novel quantum inspired cuckoo search for knapsack problems

International Journal of Bio-Inspired Computation
A New Quantum Evolutionary Algorithm with Sifting Strategy for Binary Decision Diagram Ordering Problem

International Journal of Cognitive Informatics and Natural Intelligence
A hybrid quantum inspired harmony search algorithm for 0-1 optimization problems

Journal of Computational and Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Max Sat problem is very known problem in computer science. It aims to find the best assignment for a set of Boolean variables that gives the maximum of verified clauses in a Boolean formula. Unfortunately, this problem was showed NP-Hard if the number of variable per clause is higher than 3. In this article, we propose a new iterative stochastic approach called QSAT based on a hybrid algorithm of Quantum Evolutionary Algorithm QEA and Local Search Algorithm LSA. QSAT is based on a basic core defined by a suitable quantum representation and an adapted quantum evolutionary dynamic enhanced by Local Search procedure. The obtained results are encouraging and prove the feasibility and the effectiveness of our approach. QSAT is distinguished by a reduced population size and a reasonable number of iterations to find the best assignment, thanks to the principles of quantum computing.