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. © Springer-Verlag Berlin Heidelberg 2005.
CITATION STYLE
Festa, P., Pardalos, P. M., Pitsoulis, L. S., & Resende, M. G. C. (2005). GRASP with path-relinking for the weighted maximum satisfiability problem. In Lecture Notes in Computer Science (Vol. 3503, pp. 367–379). Springer Verlag. https://doi.org/10.1007/11427186_32
Mendeley helps you to discover research relevant for your work.