Improving the Asymptotic Convergence of Memetic Algorithms - The SAT Problem Case Study

Noureddine Bouhmala

2012

Abstract

In this work, a memetic algorithm that makes use of the multilevel paradigm for solving SAT problems is presented. The multilevel paradigm refers to the process of dividing large and difficult problems into smaller ones, which are hopefully much easier to solve, and then work backward towards the solution of the original problem, using a solution from a previous level as a starting solution at the next level. Results on real industrial instances are presented.

Paper Citation

in Harvard Style

Bouhmala N. (2012). Improving the Asymptotic Convergence of Memetic Algorithms - The SAT Problem Case Study . In Proceedings of the 4th International Joint Conference on Computational Intelligence - Volume 1: ECTA, (IJCCI 2012) ISBN 978-989-8565-33-4, pages 294-296. DOI: 10.5220/0004153702940296

in Bibtex Style

@conference{ecta12,
author={Noureddine Bouhmala},
title={Improving the Asymptotic Convergence of Memetic Algorithms - The SAT Problem Case Study},
booktitle={Proceedings of the 4th International Joint Conference on Computational Intelligence - Volume 1: ECTA, (IJCCI 2012)},
year={2012},
pages={294-296},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0004153702940296},
isbn={978-989-8565-33-4},
}

in EndNote Style

TY - CONF
JO - Proceedings of the 4th International Joint Conference on Computational Intelligence - Volume 1: ECTA, (IJCCI 2012)
TI - Improving the Asymptotic Convergence of Memetic Algorithms - The SAT Problem Case Study
SN - 978-989-8565-33-4
AU - Bouhmala N.
PY - 2012
SP - 294
EP - 296
DO - 10.5220/0004153702940296