A Tabu history driven crossover operator design for memetic algorithm applied to Max-2SAT-problems

Authors:
M. Borschbach;A. Exeler
Affiliations:
University of Münster, Germany;University of Münster, Germany
Venue:
Proceedings of the 10th annual conference on Genetic and evolutionary computation
Year:
2008

Citing 4
Cited 0

Computers and Intractability; A Guide to the Theory of NP-Completeness

Computers and Intractability; A Guide to the Theory of NP-Completeness
The complexity of theorem-proving procedures

STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
GASAT: a genetic local search algorithm for the satisfiability problem

Evolutionary Computation
A search agent for a Max-2sat memetic algorithm approach

ACACOS'08 Proceedings of the 7th WSEAS International Conference on Applied Computer and Applied Computational Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

The solution for the Max-2SAT is the starting point for a selection of these strategies by a brief review. 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 and to compare it to the computational complexity of existing local search solutions.