Recombination Operators for Satisfiability Problems
Résumé
In this paper, we present several recombination operators that are specially designed for SAT problems. These operators take into account the semantic information induced by the structure of the given problem instance under consideration. Studies are carried out to assess the relative performance of these recombination operators on the one hand, and to show the high effectiveness of one of them when it is embedded into a hybrid genetic local search algorithm on the other hand.