Conference Paper

Desarrollo y Comportamiento de Hyperheurística Sencilla en la Solución de Problemas 3SAT

Conference: CONCyE 2011

ABSTRACT This work studies the behavior of two low level heuristics for 3SAT problem solution using random generalized problems. Based on this, it develops and analyzes the behavior of a simple hyperheuristics that improves the solution time and the amount of instances satisfactorily solved, against the average time and instances obtained by the simple heuristics separately.

Download full-text


Available from: Carlos Eric Galván Tejada, Sep 28, 2015
1 Follower
54 Reads
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: The constraint satisfaction problem (CSP) is one of the most prominent problems in artificial intelligence, logic, theoretical computer science, engineering and many other areas in science and industry. One instance of a CSP, the satisfiability problem in propositional logic (SAT), has become increasingly popular and has illuminated important insights into our understanding of the fundamentals of computation. Though the concept of representing propositional formulae as n-partite graphs is certainly not novel, in this paper we introduce a new polynomial reduction from 3SAT to G<sub>7 </sub> <sup>n</sup> graphs and demonstrate that this framework has advantages over the standard representation. More specifically, after presenting the reduction we show that many hard 3SAT instances represented in this framework can be solved using a basic path-consistency algorithm, and finally we discuss the potential advantages and implications of using such a representation
    Proceedings of the IEEE Symposium on Foundations of Computational Intelligence, FOCI 2007, part of the IEEE Symposium Series on Computational Intelligence 2007, Honolulu, Hawaii, USA, 1-5 April 2007; 04/2007
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: We investigate the performance of several hyperheuristics applied to a real-world personnel-scheduling problem. A hyperheuristic is a high-level search method which manages the choice of low level heuristics, making it a robust and easy to implement approach for complex real-world problems. We need only to develop new low level heuristics and objective functions to apply a hyperheuristic to an entirely new problem. Although hyperheuristic methods require limited problem-specific information, their performance for a particular problem is determined to a great extent by the quality of low level heuristics used. We address the question of designing the set of low level heuristics for the problem under consideration. We construct a large set of low level heuristics by using a technique which allows us to "multiply" partial low level heuristics. We apply hyperheuristic methods to a trainer scheduling problem using commercial data from a large financial institution. The results of the experiments show that simple hyperheuristic approaches can successfully tackle a complex real-world problem provided that low level heuristics are carefully selected to treat various constraints. We also examine how the choice of different sets of low level heuristics affects solution quality.
    Evolutionary Computation, 2003. CEC '03. The 2003 Congress on; 01/2004
  • American Scientist 03/1997; 85(2):108-112. · 0.56 Impact Factor