GRASP with Path-Relinking for the Weighted Maximum Satisfiability Problem

A GRASP with path-relinking for finding good-quality solutions of the weighted maximum satisfiability problem (MAX-SAT) is described in this paper. GRASP, or Greedy Randomized Adaptive Search Procedure, is a randomized multi-start metaheuristic, where at each iteration locally optimal solutions are constructed, each independent of the others. Previous experimental results indicate its effectiveness for solving weighted MAX-SAT instances. Path-relinking is a procedure used to intensify the search around good-quality isolated solutions that have been produced by the GRASP heuristic. Experimental comparison of the pure GRASP (without path-relinking) and the GRASP with path-relinking illustrates the effectiveness of path-relinking in decreasing the average time needed to find a good-quality solution for the weighted maximum satisfiability problem.

[1]  Pierre Hansen,et al.  Algorithms for the maximum satisfiability problem , 1987, Computing.

[2]  Roberto Battiti,et al.  Approximate Algorithms and Heuristics for MAX-SAT , 1998 .

[3]  Celso C. Ribeiro,et al.  Greedy Randomized Adaptive Search Procedures , 2003, Handbook of Metaheuristics.

[4]  David P. Williamson,et al.  New 3/4-Approximation Algorithms for the Maximum Satisfiability Problem , 1994, SIAM J. Discret. Math..

[5]  Luca Trevisan.  Approximating Satisfiable Satisfiability Problems , 2000, Algorithmica.

[6]  Fred Glover,et al.  Tabu Search and Adaptive Memory Programming — Advances, Applications and Challenges , 1997 .

[7]  Hector J. Levesque,et al.  A New Method for Solving Hard Satisfiability Problems , 1992, AAAI.

[8]  Jianer Chen,et al.  Tight bound on Johnson's algorithm for Max-SAT , 1997, Proceedings of Computational Complexity. Twelfth Annual IEEE Conference.

[9]  Mihalis Yannakakis,et al.  On the approximation of maximum satisfiability , 1992, SODA '92.

[10]  M. Trick,et al.  Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, Workshop, October 11-13, 1993 , 1996 .

[11]  Takao Asano,et al.  Approximation algorithms for MAX SAT: Yannakakis vs. Goemans-Williamson , 1997, Proceedings of the Fifth Israeli Symposium on Theory of Computing and Systems.

[12]  Celso C. Ribeiro,et al.  GRASP with Path-Relinking: Recent Advances and Applications , 2005 .

[13]  Roberto Battiti,et al.  Reactive search, a history-sensitive heuristic for MAX-SAT , 1997, JEAL.

[14]  Celso C. Ribeiro,et al.  A Hybrid GRASP with Perturbations for the Steiner Problem in Graphs , 2002, INFORMS J. Comput..

[15]  Uri Zwick,et al.  A 7/8-approximation algorithm for MAX 3SAT? , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.

[16]  Uriel Feige,et al.  Approximating the value of two power proof systems, with applications to MAX 2SAT and MAX DICUT , 1995, Proceedings Third Israel Symposium on the Theory of Computing and Systems.

[17]  Renata M. Aiex,et al.  Parallel GRASP with path-relinking for job shop scheduling , 2003, Parallel Comput..

[18]  Johan Håstad,et al.  Some optimal inapproximability results , 2001, JACM.

[19]  David S. Johnson,et al.  Approximation algorithms for combinatorial problems , 1973, STOC.

[20]  Mauricio G. C. Resende,et al.  Greedy Randomized Adaptive Search Procedures , 1995, J. Glob. Optim..

[21]  Rafael Martí,et al.  GRASP and Path Relinking for 2-Layer Straight Line Crossing Minimization , 1999, INFORMS J. Comput..

[22]  Panos M. Pardalos,et al.  GRASP with Path Relinking for Three-Index Assignment , 2005, INFORMS J. Comput..

[23]  William M. Spears,et al.  Simulated annealing for hard satisfiability problems , 1993, Cliques, Coloring, and Satisfiability.

[24]  Toby Walsh,et al.  Towards an Understanding of Hill-Climbing Procedures for SAT , 1993, AAAI.

[25]  Mauricio G. C. Resende,et al.  A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set , 1994, Oper. Res..

[26]  Panos M. Pardalos,et al.  Handbook of applied optimization , 2002 .

[27]  Jeffery L. Kennington,et al.  Interfaces in Computer Science and Operations Research , 1997 .

[28]  Celso C. Ribeiro,et al.  A GRASP with path‐relinking for private virtual circuit routing , 2003, Networks.

[29]  Celso C. Ribeiro,et al.  Local search with perturbations for the prize‐collecting Steiner tree problem in graphs , 2001, Networks.

[30]  Toshihide Ibaraki,et al.  Metaheuristics : progress as real problem solvers , 2005 .

[31]  P. Pardalos,et al.  Handbook of Combinatorial Optimization , 1998 .

[32]  Mauricio G. C. Resende,et al.  A GRASP for satisfiability , 1993, Cliques, Coloring, and Satisfiability.

[33]  David P. Williamson,et al.  Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming , 1995, JACM.

[34]  Celso C. Ribeiro,et al.  GRASP and path-relinking : Recent advances and applications , 2003 .

[35]  Panos M. Pardalos,et al.  Fortran subroutines for computing approximate solutions of weighted MAX-SAT problems using GRASP , 2000, Discret. Appl. Math..

[36]  Panos M. Pardalos,et al.  Satisfiability Problem: Theory and Applications , 1997 .

[37]  Stephen A. Cook,et al.  The complexity of theorem-proving procedures , 1971, STOC.

[38]  David S. Johnson,et al.  Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .

[39]  Panos M. Pardalos,et al.  Approximate solution of weighted MAX-SAT problems using GRASP , 1996, Satisfiability Problem: Theory and Applications.

[40]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .