Scatter search with random walk strategy for SAT and MAX-W-SAT problems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2070, Issue , 2001, Pages 35-44

  Drias, Habiba ^a   Khabzaoui, Mohamed ^a  

^a UNIVERSITY OF SCIENCES AND TECHNOLOGY HOUARI BOUMEDIENE   (Algeria)

Author keywords

Evolutionary approach; Genetic algorithm; Heuristic search; Optimization problem; Scatter search; Weighted maximum satisfiability problem

Indexed keywords

ALGORITHMS; ARTIFICIAL INTELLIGENCE; EVOLUTIONARY ALGORITHMS; EXPERT SYSTEMS; FORMAL LOGIC; GENETIC ALGORITHMS; HEURISTIC ALGORITHMS; INTELLIGENT SYSTEMS; OPTIMIZATION; RANDOM PROCESSES;

EVOLUTIONARY APPROACH; HEURISTIC SEARCH; OPTIMIZATION PROBLEMS; SCATTER SEARCH; WEIGHTED MAXIMUM SATISFIABILITY;

PROBLEM SOLVING;

EID: 84947596329     PISSN: 03029743     EISSN: 16113349     Source Type: Journal    
DOI: 10.1007/3-540-45517-5_5     Document Type: Article

References (19)

1. 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)
2. Campos V., Glover F., Laguna M., Marti R.: An Experimental Evaluation of a Scatter Search for the Linear Ordering Problem, (1999)
3. 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)
4. Drias H.: Randomness in Heuristics : an Experimental Investigation for the Maximum Satisfiability Problem, LNCS 1606 proceeding of IWANN’99, Alicante Spain, (1999) 700-708
5. 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)
6. Frank J. : A Study of genetic algorithms to find Approximate Solutions to Hard 3CNF Problems, in Golden West International Conference on Artificial Intelligence, (1994)
7. Glover F.: Heuristics for Integer Programminig Using Surrogate Constraints, Decision Sciences, vol 8, No 1, (1977) 156-166
8. Glover F.: Taboo Search for non linear and parametric optimization with links to genetic algorithms, Disc Appl Math 49, (1994) 231-255
9. Glover F., Kelly J.P., Laguna M.: Genetic Algorithms and Taboo Search : Hybrids for Optimization, Computers and Operation Reseach vol 22 1,(1995) 111-134
10. Glover F., Laguna M., R. Marti: scatter search, 2000.
11. Glover F., Laguna M., Marti R.: Fundamentals of scatter search and path relinking, 2000
12. Goldberg D.E.: Algorithmes Génétiques : Exploration, Exploitation et Apprentissage Automatique, Addison Wesley France 1994
13. Gottlieb J., Voss N.: Representations, fitness functions and genetic operators for the satisfiability problem, Springer Verlag Heidelberg (1998)
14. Hansen P., Jaumard B.: Algorithms for the Maximum Satisfiability , Computing 44, (1990) . 279-303
15. Laguna M.: Scatter Search, document internet, (1999)
16. Mazure B., Sais L., Grégoire E.: Taboo Search for SAT, in Proceedings of AAAI, (1997)
17. Mills P., Tsang E.: Solving the MAX-SAT problem using Guided Local Search, Rapport technique CSM-327, (1999)
18. 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
19. 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