Cart (Loading....) | Create Account
Close category search window
 

Solving MAX-SAT problems using a memetic evolutionary meta-heuristic

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Boughaci, D. ; Univ. of Sci. & Technol., Algiers, Algeria ; Drias, H. ; Benhamou, B.

Genetic algorithms are a population-based meta-heuristic. They have been successfully applied to many optimization problems. However, premature convergence is an inherent characteristic of such classical genetic algorithms that makes them incapable of searching numerous solutions of the problem domain. A memetic algorithm is an extension of the traditional genetic algorithm. It uses a hill climbing search technique to reduce the likelihood of the premature convergence. In this paper, a memetic approach is studied for the NP-hard satisfiability problems, in particular for its optimization version namely MAX-SAT. Our evolutionary approach applies a search technique to further improve the fitness of individuals in the genetic population. Basically, the approach combines local search heuristics with crossover operators. The method is tested and various experimental results show that memetic algorithm performs better than the classical genetic algorithms for most benchmark problems.

Published in:

Cybernetics and Intelligent Systems, 2004 IEEE Conference on  (Volume:1 )

Date of Conference:

1-3 Dec. 2004

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.