A genetic algorithm with expansion and exploration operators for the maximum satisfiability problem

There are many problems that standard genetic algorithms fail tosolve. Refinements of standard genetic algorithms that can be used tosolve hard problems has caused considerable interest. In this paper, weconsider genetic algorithms with expansion and exploration operatorsfor the maximum satisfiability problem.