A search agent for a Max-2sat memetic algorithm approach
Markus Borschbach, Andre Exeler · WSEAS international conference on Applied Computer and Applied Computational Science · 2008
Various algorithms have been suggested for the Max-SAT problem. The solution for the Max-2SAT is the starting point for a selection of these approximation algorithms. This paper aims at introducing approaches for Max-2SAT by a brief review of the basic ideas. Moreover, a memetic algorithm for Max-2SAT problems based on a specific crossover operator and an improved tabu search stage is presented. Simulation performed on several instances of Max-2SAT reference problems are used to evaluate the different memetic algorithm strategies applied in our approach. The overall performance is verified by empirical simulation and is used to compare the developed approach to other state up-to-date and of the art algorithms.