Abstract
The recent evolutionary approach called scatter search is studied for solving the satisfiability problem designated by SAT and its weighted version MAX-W-SAT. It is a population-based meta-heuristic founded on a formulation proposed two decades ago by Fred Glover. It uses linear combination on a population subset to create new solutions while other evolutionary approaches like genetic algorithms resort to randomization.
First we propose a scatter search algorithm for SAT and MAX-W-SAT, namely SS-SAT. We present a procedure to generate good scattered initial solutions, a combination operator and a technique for improving the solutions quality. The method is tested and various experimental results show that SS-SAT performs better than or as well as GRASP for most benchmark problems.
Secondly, we augment scatter search with the random walk strategy and compare its performance to the standard version. It appears that the added strategy does not lead to increased performance.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Battiti R., Protasi M.: Solving MAX-SAT with non Oblivious Functions and History based Heuristics, Dimacs Workshop on Satisfiability problems: Theory and Applications, Rutgers University, (1996)
Campos V., Glover F., Laguna M., Marti R.: An Experimental Evaluation of a Scatter Search for the Linear Ordering Problem, (1999)
Cung V. D., Mautor T., Michelon P., Tavares A.:A Scatter Search based Approach for the Quadratic Assignment Problem, research Report No 96/037 Versailles university, (1996)
Drias H.: Randomness in Heuristics: an Experimental Investigation for the Maximum Satisfiability Problem, LNCS 1606 proceeding of IWANN’99, Alicante Spain, (1999) 700–708
Drias H., Azi N.: Scatter search for SAT and MAX-W-SAT problems, to appear in the proceedings of the IEEE SSST, Ohio, USA, (2001)
Frank J.: A Study of genetic algorithms to find Approximate Solutions to Hard 3CNF Problems, in Golden West International Conference on Artificial Intelligence, (1994)
Glover F.: Heuristics for Integer Programminig Using Surrogate Constraints, Decision Sciences, vol 8, No 1, (1977) 156–166
Glover F.: Taboo Search for non linear and parametric optimization with links to genetic algorithms, Disc Appl Math 49, (1994) 231–255
Glover F., Kelly J. P., Laguna M.: Genetic Algorithms and Taboo Search: Hybrids for Optimization, Computers and Operation Reseach vol 221, (1995) 111–134
Glover F., Laguna M., R. Marti: scatter search, 2000.
Glover F., Laguna M., Marti R.: fundamentals of scatter search and path relinking, 2000
Goldberg D. E.: Algorithmes Génétiques: Exploration, Exploitation et Apprentissage Automatique, Addison Wesley France 1994
Gottlieb J., Voss N.: Representations, fitness functions and genetic operators for the satisfiability problem, Springer Verlag Heidelberg (1998)
Hansen P., Jaumard B.: Algorithms for the Maximum Satisfiability, computing 44, (1990). 279–303
Laguna M.: Scatter Search, document internet, (1999)
Mazure B., Sais L., Grégoire E.: Taboo Search for SAT, in proceedings of AAAI, (1997)
Mills P., Tsang E.: Solving the MAX-SAT problem using Guided Local Search, Rapport technique CSM-327, (1999)
Resende M. G., Pitsoulis L. S., Pardalos P. M.: Approximate Solution of Weighted MAX-SAT Problems using GRASP, in Dimacs series on discrete mathematics and theoretical computer Science vol 35, (1997) 393–405
Selman B., Kautz H. A., Cohen B.: Local Search Strategies for Satisfiability Testing, in cliques, coloring and satisfiability: second DIMACS implementation challenge, vol 26, D. S. Johnson and M. A. Tricks eds., (1996) 521–531
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Drias, H., Khabzaoui, M. (2001). Scatter Search with Random Walk Strategy for SAT and MAX-W-SAT Problems. In: Monostori, L., Váncza, J., Ali, M. (eds) Engineering of Intelligent Systems. IEA/AIE 2001. Lecture Notes in Computer Science(), vol 2070. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45517-5_5
Download citation
DOI: https://doi.org/10.1007/3-540-45517-5_5
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42219-8
Online ISBN: 978-3-540-45517-2
eBook Packages: Springer Book Archive