ERA: An Algorithm for Reducing the Epistasis of SAT Problems

  • Eduardo Rodriguez-Tello
  • Jose Torres-Jimenez
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2724)

Abstract

A novel method, for solving satisfiability (SAT) instances is presented. It is based on two components: a) An Epistasis Reducer Algorithm (ERA) that produces a more suited representation (with lower epistasis) for a Genetic Algorithm (GA) by preprocessing the original SAT problem; and b) A Genetic Algorithm that solves the preprocesed instances.

ERA is implemented by a simulated annealing algorithm (SA), which transforms the original SAT problem by rearranging the variables to satisfy the condition that the most related ones are in closer positions inside the chromosome.

Results of experimentation demonstrated that the proposed combined approach outperforms GA in all the tests accomplished.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Eduardo Rodriguez-Tello
    • 1
  • Jose Torres-Jimenez
    • 1
  1. 1.Computer Science DepartmentITESM Campus CuernavacaTemixco MorelosMexico

Personalised recommendations