Advertisement

Efficient and Experimental Meta-heuristics for MAX-SAT Problems

  • Dalila Boughaci
  • Habiba Drias
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3503)

Abstract

Many problems in combinatorial optimization are NP-Hard. This has forced researchers to explore meta-heuristic techniques for dealing with this class of complex problems and finding an acceptable solution in reasonable time. The satisfiability problem, SAT, is studied by a great number of researchers the three last decades. Its wide application to the domain of AI in automatic reasoning and problem solving for instance and other domains like VLSI and graph theory motivates the huge interest shown for this problem. In this paper, tabu search, scatter search, genetic algorithms and memetic evolutionary meta-heuristics are studied for the NP-Complete satisfiability problems, in particular for its optimization version namely MAX-SAT. Experiments comparing the proposed approaches for solving MAX-SAT problems are represented. The empirical tests are performed on DIMACS benchmark instances.

Keywords

Genetic Algorithm Local Search Tabu Search Memetic Algorithm Conjunctive Normal Form 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Boughaci, D., Drias, H.: Solving Weighted Max-Sat Optimization Problems Using a Taboo Scatter Search Meta-heuristic. In: Proceedings of ACM Sac 2004, pp. 35–36 (2004)Google Scholar
  2. 2.
    Boughaci, D., Drias, H.: PTS: A Population-based Tabu Search for the Maximum Satisfi-ability Problems. In: The Proceedings of the 2 IEEE GCC conferences, pp. 622–625 (2004)Google Scholar
  3. 3.
    Boughaci, D., Drias, H., Benhamou, B.: Solving Max-Sat Problems Using a me-metic evolutionary Meta-heuristic. In: Proceedings of 2004, pp. 480–484. IEEE CIS, Los Alamitos (2004)Google Scholar
  4. 4.
    Boughaci, D., Drias, H.: Taboo Search as an Intelligent Agent for Bid Evaluation. In: Proceedings of CE 2003, book1, Portugal, pp. 43–48 (2003)Google Scholar
  5. 5.
    Cook, S.: The Complexity of Theorem Proving Procedures. In: The Proceedings of the 3rdAnnual ACM Symposium on the Theory of Computing (1971)Google Scholar
  6. 6.
    Davis, M., Putnam, G., Loveland, D.: A machine program for theorem proving. communication of the ACM, 394–397 (July 1962)Google Scholar
  7. 7.
    Drias, H.: Scatter search with walk strategy for solving hard Max-W-Sat problems. In: Monostori, L., Váncza, J., Ali, M. (eds.) IEA/AIE 2001. LNCS, vol. 2070, pp. 35–44. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  8. 8.
    Frank, J.: A study of genetic algorithms to find approximate solutions to hard 3CNF problems. In: Proceedings of Golden West international conference on artificial intelligence (1994)Google Scholar
  9. 9.
    Garey, M., Johnson, S.: Computer and intractability, a guide to the theory of NP-Completeness. Freeman company, Sanfranscsco (1978)Google Scholar
  10. 10.
    Glover, F.: Future paths for integer programming and links to Artificial intelligence. operational search 31 (1986)Google Scholar
  11. 11.
    Glover, F.: Tabu search: Part I, ORSA. journal on computing (1989)Google Scholar
  12. 12.
    Goldberg, D.E.: Genetic Algorithms in search, Optimization & Machine Learning. Addison-Wesley, Wokingham (1989)zbMATHGoogle Scholar
  13. 13.
    Greistorfer, P.: A Tabu Scatter search meta-heuristic for the arc routing problem. Elsevier Science, Amsterdam (2002)Google Scholar
  14. 14.
    Hansen, P., Jaumard, B.: Algorithms for the Maximum Satisfiability. journal of computing 44, 279–303 (1990)zbMATHCrossRefMathSciNetGoogle Scholar
  15. 15.
    Hoos, H.H., Stutzle, T.: SATLIB: An online resource for research on SAT. In: Gent, I., van Maaren, H., Walsh, T. (eds.) SAT 2000: Highlights of Satisfiability Research in theYear 2000, Frontiers in Artificial Intelligence and Applications, pp. 283–292. Kluwer Academic, Dordrecht (2000)Google Scholar
  16. 16.
    Johnson, S.: Approximation algorithms for combinatorial problems. Journal of Computer and System Sciences 9, 256–278 (1974)zbMATHCrossRefMathSciNetGoogle Scholar
  17. 17.
    Kauffman, S.A., Levin: Towards a general theory of adaptive walks on rugged land-scapes. J. theory. Biol. 128, 11 (1987)CrossRefMathSciNetGoogle Scholar
  18. 18.
    Laguna, M., Glover, F.: “Scatter Search”, Graduate school of business, University of Colorado, Boulder (1999)Google Scholar
  19. 19.
    Laguna, M., Marti, R., Campos, V.: Scatter Search for the linear ordering problem, University of Colorado, Boulder (1999)Google Scholar
  20. 20.
    Li, C.: Exploiting yet more the power of unit clause propagation to solve 3-sat problem. In: ECAI 1996, workshop on advances in propositional deduction, Boudapest, Hungray, pp. 11–16 (1996)Google Scholar
  21. 21.
    Li, C., Anbulagan: Heuristic based on unit propagation for satisfiability. In: Smolka, G. (ed.) CP 1997, vol. 1330, pp. 342–356. Springer, Heidelberg (1997)CrossRefGoogle Scholar
  22. 22.
    Mazure, B., Sais, L., Greroire, E.: A Tabu search for Sat. In: Proceedings of AAAI 1997 (1997)Google Scholar
  23. 23.
    Moscato, P.: On evolution, search, optimization, genetic algorithms and martial arts: toward memetic algorithms (1989)Google Scholar
  24. 24.
    Pardalos, P., Pitsoulis, L., Resende, M.: A Parallel GRASP for MAX-SAT Problems. In: PARA 1996 Workshop on Applied Parallel Computing in Industrial Problems and Optimization, Lynghy, Denmark, August 18-21 (1996)Google Scholar
  25. 25.
    Selman, B., Henry, A., Kautz, Z., Cohen, B.: Local Search Strategies for Satisfiability Testing. In: Presented at the second DIMACS Challenge on Cliques, Coloring, and Satisfiability (October 1993)Google Scholar
  26. 26.
    Taillard, E.: Parallel Taboo search techniques for Job Shop Scheduling problem. ORSA Journal on Computing 6, 108–117 (1994)zbMATHGoogle Scholar
  27. 27.
    Wassan, N.A., Osman, I.H.: Tabu search variants for the mix fleet vehicle routing problem. Tech. rep., School of Business, American University of Beirut, forthcoming in J. Opl Res. Soc. (2002)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Dalila Boughaci
    • 1
  • Habiba Drias
    • 2
  1. 1.ITSUniversity of sciences and technologyAlgiersAlgeria
  2. 2.National Institute of Computer ScienceAlger

Personalised recommendations