Advertisement

Efficient Initial Solution to Extremal Optimization Algorithm for Weighted MAXSAT Problem

  • Mohamed El-bachir Menai
  • Mohamed Batouche
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2718)

Abstract

Stochastic local search algorithms are proved to be one of the most effective approach for computing approximate solutions of hard combinatorial problems. Most of them are based on a typical randomness related to uniform distributions for generating initial solutions. Particularly, Extremal Optimization is a recent meta-heuristic proposed for finding high quality solutions to hard optimization problems. In this paper, we introduce an algorithm based on another distribution, known as the Bose-Einstein distribution in quantum physics, which provides a new stochastic initialization scheme to an Extremal Optimization procedure. The resulting algorithm is proposed for the approximated solution to an instance of the weighted maximum satisfiability problem (MAXSAT). We examine its effectiveness by computational experiments on a large set of test instances and compare it with other existing meta-heuristic methods. Our results are remarkable and show that this approach is appropriate for this class of problems.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Bak, P., Tang, C., Wiesenfeld, K.: Self-organized Criticality: An Explanation of 1/f-noise. Physical Review Letters, V86 N23. (1987) 5211–5214MathSciNetGoogle Scholar
  2. 2.
    Bak, P., Sneppen, K.: Punctuated Equilibrium and Criticality in a Simple Model of Evolution. Physical Review letters, 59. (1993) 381–384CrossRefGoogle Scholar
  3. 3.
    Battiti, R., Protasi, M.: Reactive Search, a History-Sensitive Heuristic for MAXSAT. ACM Journal of Experimental Algorithmics, Vol. 2, Paper 2 (1997)Google Scholar
  4. 4.
    Boettcher, S., Percus, A.G.: Nature’s Way of Optimizing. Elsevier Science, Artificial Intelligence, 119. (2000) 275–286MATHGoogle Scholar
  5. 5.
    Boettcher, S., Percus, A.G.: Optimization with Extremal Dynamics. Physical Review Letters, V86 N23. (2001a) 5211–5214CrossRefGoogle Scholar
  6. 6.
    Boettcher, S., Percus, A.G.: Extremal Optimization for Graph Partitioning. Physical Review E, V64 026114. (2001b) 1–13CrossRefGoogle Scholar
  7. 7.
    Cook, S. A.: The Complexity of Theorem Proving Procedures. Proceedings of the 3rd Annual ACM Symposium of the Theory of Computation. (1971) 263–268Google Scholar
  8. 8.
    Dorigo, M., Maniezzo, V., Colorni, A.: The Ant System: Optimization by a Colony of Cooperating Agents. IEEE Transactions on Systems, Man, and Cybernetics-Part B, Vol. 26, N1. (1996) 1–13CrossRefGoogle Scholar
  9. 9.
    Gent, I.P., Walsh, T.: Towards an Understanding of Hill-Climbing Procedures for SAT. Proceedings of the 11th National Conference on Artificial Intelligence. (1993) 28–33Google Scholar
  10. 10.
    Glover, F.: Tabu Search: Part I. ORSA Journal on Computing 1(3). (1989a) 190–206MATHGoogle Scholar
  11. 11.
    Glover, F.: Tabu Search: Part II. ORSA Journal on Computing 2(1). (1989a) +32MathSciNetGoogle Scholar
  12. 12.
    Hansen, P., Jaumard, B.: Algorithms for the Maximum Satisfiability Problems. Computing, 44. (1990) 279–303MATHCrossRefMathSciNetGoogle Scholar
  13. 13.
    Johnson, D.: Approximation Algorithms for Combinatorial Problems. Journal of Computer and System Sciences, 9. (1974) 256–278MATHMathSciNetCrossRefGoogle Scholar
  14. 14.
    Kirkpatrick, S., Gelatt, C.D., Vecchi, P.M.: Optimization by Simulated Annealing. Science, 220. (1983) 671–680CrossRefMathSciNetGoogle Scholar
  15. 15.
    Mazure, B., Sais, L., Gregoire, E.: Tabu Search for SAT. Proceedings of the 14th National Conference on Artificial Intelligence and 9th Innovative Applications of Artificial Intelligence Conference. (1997) 281–285Google Scholar
  16. 16.
    McAllester, D., Selman, B., Kautz, H.A.: Evidence for Invariants in Local Search. Proceedings of AAAI’92. MIT Press (1997) 321–326Google Scholar
  17. 17.
    Menai, M.B., Batouche, M.: Extremal Optimization for MAXSAT. Proceedings of the International Conference on Artificial Intelligence (IC-AI’02), Las Vegas, USA. 954–958Google Scholar
  18. 18.
    Metropolis, N., Rosenbluth, A.W., Rosenbluth, M.N., Teller, A.H., Teller, E.: Equation of state calculations by fast computing machines. Journal of Chemical Physics, 21. (1953) 1087–1092CrossRefGoogle Scholar
  19. 19.
    Resende, M.G.C., Pitsoulis, L.S., Pardalos, P.M.: Approximate Solution of Weighted MAX-SAT Problems using GRASP. In Satisfiability Problem: Theory and Applications, Vol. 35 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science (American Mathematical Society, 1997). (1997) 393–405MathSciNetGoogle Scholar
  20. 20.
    Ross, M. S.: Introduction to Probability Models. Academic Press, New York. (2000) 137–141MATHGoogle Scholar
  21. 21.
    Selman, B., Kautz, H.A.: An Empirical Study of Greedy Local Search for Satisfiability Testing. Proceedings of the 11th National Conference on Artificial Intelligence. (1993a) 46–51Google Scholar
  22. 22.
    Selman, B., Kautz, H.A.: Domain Independent Extensions to GSAT: Solving Large Structured Satisfiability Problems. Proceedings of the 13th International Joint Conference on Artificial Intelligence. (1993b) 290–295Google Scholar
  23. 23.
    Selman, B., Kautz, H.A., Cohen B.: Noise Strategies for Improving Local Search. Proceedings of the 12th National Conference on Artificial Intelligence. (1994) 337–343Google Scholar
  24. 24.
    Spears, W. M.: Simulated Annealing for Hard Satisfiability Problems. In D.S. Johnson and M.A. Trick (eds.), Cliques, Coloring and Satisfiability: Second DIMACS Implementation Challenge, Vol. 26 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science (American Mathematical Society, 1996). (1996) 553–558Google Scholar
  25. 25.
    Szedmak, S.: How to Find More Efficient Initial Solution for Searching ? RUTCOR Research Report, 49-2001, Rutgers Center for Operations Research, Rutgers University. (2001)Google Scholar
  26. 26.
    Yagiura, M., Ibaraki, T.: Efficient 2 and 3-Flip Neighborhood Search Algorithms for the MAX SAT: Experimental Evaluation. Journal of Heuristics, 7. (2001) 423–442MATHCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Mohamed El-bachir Menai
    • 1
  • Mohamed Batouche
    • 2
  1. 1.Computer Science DepartmentTebessa UniversityTebessaAlgeria
  2. 2.LIRE Laboratory, Computer Science DepartmentMentouri UniversityConstantineAlgeria

Personalised recommendations