By Topic

On robustness of permutations sequencing operators: Solving satisfiability of random 3 — CNFs by simple crossover

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
$33 $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

1 Author(s)
Marco Carpentieri ; Dipartimento di Matematica ed Informatica, Universitá della Basilicata, Via dell'Ateneo Lucano 10, Potenza, Italy

Permutations sequencing operators have been proved to be effective in solving (mild restrictions of) randomized hard problems such as that of finding Hamiltonian cycles in random graphs (with suitable edge densities). We introduce a simple polynomial reduction of the problem of computing satisfiability assignments for random boolean formulas in conjunctive normal form and with clauses consisting of exactly three literals (random 3 - CNFs) to a constrained variant of the problem of computing simple paths in undirected graphs. We provide experimental results evidencing that a simple crossover technique, incorporated into the framework of a memetic model, inspired by Sexual Selection and Elitist/Evolution Strategy principles, is effective in practice to try to solve the satisfiability problem (for random 3 - CNF instances satisfiable by hidden assignments).

Published in:

2011 IEEE Congress of Evolutionary Computation (CEC)

Date of Conference:

5-8 June 2011