Combining solutions of the optimum satisfiability problem using evolutionary tunneling

The optimum satisfiability problem involves determining values for Boolean variables to satisfy a Boolean expression, while maximizing the sum of coefficients associated with the variables chosen to be true. Existing literature has identified a tabu search heuristic as the best method to deal with h...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Mendel (Brno (Czech Republic)) Jg. 26; H. 1; S. 23 - 29
Hauptverfasser: da Silva, Rodrigo Ferreira, Hvattum, Lars Magnus, Glover, Fred
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Brno University of Technology 01.08.2020
Schlagworte:
adaptive memory programming
boolean optimization
metaheuristic
recombination operator
tabu search
zero-one integer programming
ISSN:1803-3814, 2571-3701
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:The optimum satisfiability problem involves determining values for Boolean variables to satisfy a Boolean expression, while maximizing the sum of coefficients associated with the variables chosen to be true. Existing literature has identified a tabu search heuristic as the best method to deal with hard instances of the problem. This paper combines the tabu search with a simple evolutionary heuristic based on the idea of tunneling between local optima. When combining a set of solutions, variables with common values in all solutions are identified and fixed. The remaining free variables in the problem may be decomposed into several independent subproblems, so that parts of the solutions combined can be extracted and combined in an improved solution. This solution can be further improved by applying the tabu search in an improvement stage. The value of the new heuristic is demonstrated in extensive computational experiments on both existing and new test instances.
ISSN:1803-3814
2571-3701
DOI:10.13164/mendel.2020.1.023