A recently developed evolutionary algorithm called Elitist
Generational Genetic Chromodynamics (EGGC) for solving multimodal optimization problems is
applied for solving the 3-SAT problem. When applying a classical
genetic algorithm for solving satisfiability problems, the issue
that can arise consists of the algorithm getting blocked in local
optima; the overall optimum can be escaped and the conclusion can
be wrong, i.e. that the formula cannot be satisfied. With
a multimodal optimization algorithm, multiple subpopulations are
evolved and all optima are found at the same time. The conclusion
has many more chances to be correct.