Reactive Search, a history-based heuristic for MAX-SAT

The Reactive Search (RS) method proposes the integration of a simple history-based feedback scheme into local search for the on-line determination of free parameters. In this paper a new RS algorithm is proposed for the approximated solution of the Maximum Satissability problem: a component based on local search with temporary prohibitions is complemented with a reactive scheme that determines (\learns") the appropriate value of the prohibition parameter by monitoring the Hamming distance along the search trajectory (algorithm H-RTS). In addition, the non-oblivious functions recently introduced in the framework of approximation algorithms are used to discover a better local optimum in the initial part of the search. The algorithm is developed in two phases. First the bias-diversiication properties of individual candidate components are analyzed by extensive empirical evaluation, then a reactive scheme is added to the winning component, based on Tabu Search. The nal tests on a benchmark of random MAX{3{SAT and MAX{4{SAT problems demonstrate the superiority of H-RTS with respect to alternative heuristics.

[1]  Toby Walsh,et al.  Towards an Understanding of Hill-Climbing Procedures for SAT , 1993, AAAI.

[2]  Bart Selman,et al.  Noise Strategies for Improving Local Search , 1994, AAAI.

[3]  John N. Hooker,et al.  Testing heuristics: We have it all wrong , 1995, J. Heuristics.

[4]  Toby Walsh,et al.  An Empirical Analysis of Search in GSAT , 1993, J. Artif. Intell. Res..

[5]  Paola Alimonti.  New Local Search Approximation Techniques for Maximum Generalized Satisfiability Problems , 1996, Inf. Process. Lett..

[6]  Rajeev Motwani,et al.  On syntactic versus computational views of approximability , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[7]  Jun Gu,et al.  Parallel algorithms and architectures for very fast AI search , 1991 .

[8]  Roberto Battiti,et al.  The Reactive Tabu Search , 1994, INFORMS J. Comput..

[9]  Jan Korst,et al.  Deterministic and randomized local search , 1993 .

[10]  Bart Selman,et al.  An Empirical Study of Greedy Local Search for Satisfiability Testing , 1993, AAAI.

[11]  Leslie G. Valiant,et al.  A theory of the learnable , 1984, STOC '84.

[12]  Jun Gu,et al.  Algorithms for the satisfiability (SAT) problem: A survey , 1996, Satisfiability Problem: Theory and Applications.

[13]  Steven Minton,et al.  Solving Large-Scale Constraint-Satisfaction and Scheduling Problems Using a Heuristic Repair Method , 1990, AAAI.

[14]  Cecilia R. Aragon,et al.  Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning , 1991, Oper. Res..

[15]  Mauricio G. C. Resende,et al.  Designing and reporting on computational experiments with heuristic methods , 1995, J. Heuristics.

[16]  David S. Johnson,et al.  Approximation algorithms for combinatorial problems , 1973, STOC.

[17]  Fred W. Glover,et al.  Tabu Search - Part I , 1989, INFORMS J. Comput..

[18]  Panos M. Pardalos,et al.  Continuous Approaches to Discrete Optimization Problems , 1996 .

[19]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[20]  Bart Selman,et al.  Local search strategies for satisfiability testing , 1993, Cliques, Coloring, and Satisfiability.

[21]  Hector J. Levesque,et al.  Hard and Easy Distributions of SAT Problems , 1992, AAAI.

[22]  Roberto Battiti,et al.  Solving MAX-SAT with non-oblivious functions and history-based heuristics , 1996, Satisfiability Problem: Theory and Applications.

[23]  Giorgio Ausiello,et al.  Theoretical Computer Science Approximate Solution of Np Optimization Problems * , 2022 .