A genetic algorithm with expansion and exploration operators for the maximum satisfiability problem
Anna Gorbenko, Vladimir Popov · Applied Mathematical Sciences · 2013
There are many problems that standard genetic algorithms fail to solve. Refinements of standard genetic algorithms that can be used to solve hard problems has caused considerable interest. In this paper, we consider genetic algorithms withexpansion and exploration operators for the maximum satisfiability problem.