A multilevel memetic algorithm for the satisfiability problem

International Journal of Artificial Intelligence

Volumn 8, Issue 12 S, 2012, Pages 78-96

  Bouhmala, N ^a  

^a Department of Maritime Technology and Innovation   (Norway)

Author keywords

Memetic algorithms; Multilevel techniques; Satisfiability problem

Indexed keywords

EID: 84863576152     PISSN: 09740635     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (46)

1. Barnard, S.T., Simon, H.D. 1994, A fast multilevel implementation of recursive spectral bisection for partitioning unstructured problems. Concurrency: Practice and Experience, 6(2), 101-117.
2. Blum, C., and Roli, A., 2003, Metaheuristics in combinatorial optimization: Overview and conceptual comparison. ACM Computing Surveys, 35(3), 268-308.
3. Boughaci, D., and Drias, H., 2005, Efficient and experimental meta-heuristics for MAX-SAT problems. In Lecture Notes in Computer Sciences, WEA 2005, vol. 3503/2005, 501-512.
4. Boughaci, D., and Benhamou, B., Drias, H., 2008, Scatter Search and Genetic Algorithms for MAX-SAT Problems. J. Math. Model. Algorithms, 101-124.
5. Cook, S.A. 1971, The complexity of theorem-proving procedures. Proceedings of the Third ACM Symposium on Theory of Computing, 151-158.
6. Gary, M.R., and Johnson, D.S. 1979, Computers and intractability: A guide to the theory of NP-completeness. W.H. Freeman and Company.
7. Gent, I., and Walsh, T., 1995, Unsatisfied Variables in Local Search. In J. Hallam, editor, Hybrid Problems, Hybrid Solutions, 73-85. IOS Press.
8. Gent, L.P., and Walsh., T., 1993, Towards an Understanding of Hill-Climbing Procedures for SAT. Proceedings of AAAI'93, 28-33. MIT Press.
9. Glover, F., 1989, Tabu Search-Part1. ORSA Journal on Computing, 1(3), 190-206.
10. Gottleib, J., Marchiori E., and Rossi., C. 2002, Evolutionary Algorithms for the satisfiability problem. Evolutionary Computation, 10(1), 35-50.
11. Granmo, O.C., and Bouhmala, N., 2007, Solving the Satisfiability Problem Using Finite Learning Automata. International Journal of Computer Science and Applications, Volume 4, Issue 3, 15-29.
12. Hadany, R., and Harel, D., 1999, A multi-scale algorithm for drawing graphs nicely. Tech. Rep. CS99-01, Weizmann Inst. Sci., Faculty Maths. Comp. Sci.
13. Hansen, P., and Jaumand, B., 1990, Algorithms for the Maximum Satisfiability Problem. Computing, 44, 279-303.
14. Hendrickson, B., and Leland, R., 1995, A multilevel algorithm for partitioning graphs. In S. Karin, editor, Proc. Supercomputing'95, San Diego, ACM Press, New York.
15. Hoos, H., 1999, On the run-time behavior of stochastic local search algorithms for SAT. In. Proceedings of AAAI-99, 661-666.
16. Hoos, H., 2002, An adaptive noise mechanism for Walksat. In Proceedings of the Eighteen National Conference in Artificial Intelligence (AAAI-02), 655-660.
17. Hutter, F., Tompkins, D., and Hoos, H., 2002, Scaling and probabilistic smoothing: Efficient dynamic local search for SAT. In Proceedings of the Eight International Conference of the Principles and Practice of Constraint Programming (CP'02), 233-248.
18. Ishtaiwi, A., Thornton, J., Sattar, A., and Pham, D.N., 2005, Neighborhood clause weight redistribution in local search for SAT. Proceedings of the Eleventh International Conference on Principles and Practice Programming(CP-05), volume 3709 of Lecture Notes in Computer Science, 772-776.
19. Jin-Kao, H., Lardeux, F., and Saubion, F., 2003, Evolutionary computing for the satisfiability problem. In Applications of Evolutionary Computing, volume 2611 of LNCS, 258-267, University of Essex, England.
20. Karypis, G., and Kumar, V., 1998, A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM J. Sci. Comput., 20(1), 359-392.
21. Karypis, G., and Kumar, V., 1998, Multilevel k-way partitioning scheme for irregular graphs. J. Par. Dist. Comput., 48(1), 96-129.
22. KhudaBukhsh, A.R., Xu, L., Hoos, H., and Leyton-Brown, K., 2009, SATenstein: Automatically Building Local Search SAT Solvers From Components. Proceedings of the 25th International Joint Conference on Artificial Intelligence (IJCAI-09).
23. Lardeux, F., Saubion, F., and Jin-Kao, H., 2006, GASAT: A Genetic Local Search Algorithm for the Satisfiability Problem. Evolutionary Computation, volume 14 (2), MIT Press.
24. Li, C.M., Wei, W., and Zhang, H., 2007, Combining adaptive noise and look-ahead in local search for SAT. Proceedings of the Tenth International Conference on Theory and Applications of Satisfiability Testing(SAT-07), volume 4501 of Lecture Notes in Computer Science, 121-133.
25. Li, C.M., Huang, W.Q., 2005, Diversification and determinism in local search for satisfiability. In proceedings of the Eight International Conference on Theory and Applications of Satisfiability Testing (SAT-05), volume 3569 of Lecture Notes in Computer Science, 158-172.
26. Li, C.M., Wei, W., and Zhang, H., 2007, Combining adaptive noise and look-ahead in local search for SAT. In Proceedings of the Tenth International Conference on Theory and Applications of Satisfiability Testing (SAT-07), volume 4501 of Lecture Notes in Computer Science, 121-133.
27. Lozano, M., and Martinez, C.G., 2010, Hybrid metaheuristics with evolutionary algorithms specializing in intensification and diversification: Overview and progress report. Computers and operations Research, 37, 481-497.
28. McAllester, D., Selman, B., and Kautz, H., 1997, Evidence for Invariants in Local Search. Proceedings of AAAI'97, 321-326. MIT Press.
29. Moscato, P.A., 1989, On evolution search, optimization, genetic algorithms and martial arts: Towards memetic algorithms. Technical Report Caltech Concurrent Computation Program, Caltech, Pasadena, California.
30. Patterson., D.J., and Kautz, H., 2001, Auto-Walksat: A Self-Tuning Implementation of Walksat. Electronic Notes on Discrete Mathematics 9.
31. Prestwich, S., 2005, Random walk with continuously smoothed variable weights. Proceedings of the Eight International Conference on Theory and Applications of Satisfiability Testing(SAT-05), volume 3569 of Lecture Notes, 203-215.
32. Schuurmans, D., and Southey, F., 2000, Local search characteristics of incomplete SAT procedures. In Proc. AAAI-2000, 297-302, AAAI Press.
33. Schuurmans, D., Southey, F., and Holte, R.C., 2001, The exponentiated sub-gradient algorithm for heuristic Boolean programming. In Proc. IJCAI-01, 334-341, Morgan Kaufman Publishers.
34. Selman, B., Levesque, H., and Mitchell, D., 1992, A New Method for Solving Hard Satisfiability Problems. Proceedings of AAA'92, 440-446, MIT Press.
35. Selman, B., Kautz, H.A., and Cohen, B., 1994, Noise Strategies for Improving Local Search. Proceedings of AAAI'94, 337-343. MIT Press.
36. Selman., B., and Kautz, H.A., 1993, Domain-Independent extensions to GSAT: Solving large structured satisfiability problems. In R. Bajcsy, editor, Proceedings of the international Joint Conference on Artificial Intelligence, volume 1, 290-295. Morgan Kaufmann Publishers Inc.
37. Spears, W., 1995, Adapting Crossover in Evolutionary Algorithms. Proc of the Fourth Annual Conference on Evolutionary Programming, MIT Press, 367-384.
38. Thornton, J., Pham, D.N., Bain, S., and Ferreira, V., 2004, Additive versus multiplicative clause weighting for SAT. Proceedings of the Nineteenth National Conference of Artificial Intelligence (AAAI-04), 191-196.
39. Vrajitoru, D., 1999, Genetic programming operators applied to genetic algorithms. In Proceedings of the Genetic and Evolutionary Computation Conference, 686-693, Orlando (FL). Morgan Kaufmann Publishers.
40. Walshaw, C., 2001. A Multilevel Approach to the Graph Colouring Problem. Tech. Rep. 01/IM/69, Comp. Math. Sci., Univ. Greenwich, London SE10 9LS, UK.
41. Walshaw, C., 2003, A Multilevel Algorithm for Forced-Directed Graph-Drawing. Journal of Graph Algorithms and Applications, 7(3), 253-285.
42. Walshaw, C., and Cross, M., 2000. Mesh partitioning: A multilevel balancing and refinement algorithm. SIAM J. Sci. Comput., 22(1), 63-80.
43. Walshaw, C., 2002, A Multilevel Approach to the Traveling Salesman Problem. Oper. Res., 50(5), 862-877.
44. Walshaw, C. 2001. A Multilevel Lin-Kerninghan-Helsgaun Algorithm for the Traveling Salesman Problem. Tech. Rep. 01/IM/80, Comp. Math. Sci., Univ. Greenwich.
45. Wu, Z., and Wah, B., 2000, An efficient global-search strategy in discrete Lagrangian methods for solving hard satisfiability problems. In Proceedings of the Seventeenth National Conference on Artificial Intelligence (AAAI-00), 310-315.
46. Xu, L., Hutter, F., Hoos, H., and Leyton-Brown, K., 2008, SATzilla: Portfolio-based Algorithm Selection for SAT. Journal of Artificial Intelligence Research (JAIR), vol. 32, 565-606.