Evolutionary Diversity Optimisation in Constructing Satisfying Assignments

by   Adel Nikfarjam, et al.

Computing diverse solutions for a given problem, in particular evolutionary diversity optimisation (EDO), is a hot research topic in the evolutionary computation community. This paper studies the Boolean satisfiability problem (SAT) in the context of EDO. SAT is of great importance in computer science and differs from the other problems studied in EDO literature, such as KP and TSP. SAT is heavily constrained, and the conventional evolutionary operators are inefficient in generating SAT solutions. Our approach avails of the following characteristics of SAT: 1) the possibility of adding more constraints (clauses) to the problem to forbid solutions or to fix variables, and 2) powerful solvers in the literature, such as minisat. We utilise such a solver to construct a diverse set of solutions. Moreover, maximising diversity provides us with invaluable information about the solution space of a given SAT problem, such as how large the feasible region is. In this study, we introduce evolutionary algorithms (EAs) employing a well-known SAT solver to maximise diversity among a set of SAT solutions explicitly. The experimental investigations indicate the introduced algorithms' capability to maximise diversity among the SAT solutions.


page 1

page 2

page 3

page 4


Co-Evolutionary Diversity Optimisation for the Traveling Thief Problem

Recently different evolutionary computation approaches have been develop...

Computing High-Quality Solutions for the Patient Admission Scheduling Problem using Evolutionary Diversity Optimisation

Diversification in a set of solutions has become a hot research topic in...

Evolutionary Diversity Optimisation for The Traveling Thief Problem

There has been a growing interest in the evolutionary computation commun...

Computing Diverse Sets of High Quality TSP Tours by EAX-Based Evolutionary Diversity Optimisation

Evolutionary algorithms based on edge assembly crossover (EAX) constitut...

A comparison of encodings for cardinality constraints in a SAT solver

Cardinality constraints are important in many Sat problems; previous stu...

Solving Rep-tile by Computers: Performance of Solvers and Analyses of Solutions

A rep-tile is a polygon that can be dissected into smaller copies (of th...

ATM-R: An Adaptive Tradeoff Model with Reference Points for Constrained Multiobjective Evolutionary Optimization

The goal of constrained multiobjective evolutionary optimization is to o...

Please sign up or login with your details

Forgot password? Click here to reset