Abstract
In this work we investigate the effects of the parallelization of a local search algorithm for MAX-SAT. The variables of the problem are divided in subsets and local search is applied to each of them in parallel, supposing that variables belonging to other subsets remain unchanged. We show empirical evidence for the existence of a critical level of parallelism which leads to the best performance. This result allows to improve local search and adds new elements to the investigation of criticality and parallelism in combinatorial optimization problems.
Corresponding author. This work was partially developed during a visiting period at IRIDIA — Université Libre de Bruxelles.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Roberto Battiti and Marco Protasi. Reactive Search, a history-base heuristic for MAX-SAT. ACM Journal of Experimental Algorithmics, 1997.
Patrice Calegari, Giovanni Coray, Alain Hertz, Daniel Kobler, and Pierre Kuonen. A taxonomy of evolutionary algorithms in combinatorial optimization. Journal of Heuristics, 5:145–158, 1999.
David Corne, Marco Dorigo, and Fred Glover, editors. New Ideas in Optimization. Advanced topics in computer science series. McGraw-Hill, 1999.
Frank-Michael Dittes. Optimization on rugged landscapes: A new general purpose Monte Carlo approach. Physical Review Letters, 76(25):4651–4655, June 1996.
Marco Dorigo and Gianni Di Caro. The Ant Colony Optimization meta-heuristic. In D. Corne, M. Dorigo, and F. Glover, editors, New Ideas in Optimization, pages 11–32. McGraw-Hill, 1999. Also available as Technical Report IRIDIA/99-1, Universit é Libre de Bruxelles, Belgium.
Michael R. Garey and David S. Johnson. Computers and intractability; a guide to the theory of NP-completeness. W.H. Freeman, 1979.
Fred Glover and Manuel Laguna. Tabu Search. Kluwer Academic Publichers, 1997.
Pierre Hansen and Nenad Mladenovic. An introduction to Variable Neighborhood Search. In Stefan Voss, Silvano Martello, Ibrahim Osman, and Catherine Roucairol, editors, Meta-heuristics: advances and trends in local search paradigms for optimization, chapter 30, pages 433–458. Kluwer Academic Publishers, 1999.
Stuart A. Kauffman. The origins of order. Oxford University Press, New York, 1993.
Stuart A. Kauffman. At home in the universe. Oxford Press, 1995.
Stuart A. Kauffman and William Macready. Technological evolution and adaptive organizations. Complexity, 26(2):26–43, March 1995.
S. Kirkpartick, C. D. Gelatt, and M. P. Vecchi. Optimization by simulated annealing. Science, 13 May 1983, 220(4598):671–680, 1983.
William G. Macready, Athanassios G. Siapas, and Stuart A. Kauffman. Criticality and parallelism in combinatorial optimization. Science, 271:56–59, January 1996.
David McAllester, Bart Selman, and Henry Kautz. Evidence for invariants in local search. In Proceedings of the 14th National Conference on Artificial Intelligence and 9th Innovative Applications of Artificial Intelligence Conference (AAAI-97/IAAI-97), pages 321–326, Menlo Park, July 27–31 1997. AAAI Press.
Patrick Mills and Edward Tsang. Guided Local Search for solving SAT and weighted MAX-SAT Problems. In Ian Gent, Hans van Maaren, and Toby Walsh, editors, SAT2000, pages 89–106. IOS Press, 2000.
David G. Mitchell, Bart Selman, and Hector J. Levesque. Hard and easy distributions of sat problems. In Proceedings, Tenth National Conference on Artificial Intelligence, pages 459–465. AAAI Press/MIT Press, July 1992.
P. Moscato. Memetic algorithms: A short introduction. In F. Glover D. Corne and M. Dorigo, editors, New Ideas in Optimization. McGraw-Hill, 1999.
Andrea Roli. Criticality and parallelism in GSAT. In Henry Kautz and Bart Selman, editors, Electronic Notes in Discrete Mathematics, volume 9. Elsevier Science Publishers, 2001.
Bart Selman, Hector J. Levesque, and David G. Mitchell. A new method for solving hard satisfiability problems. In Paul Rosenbloom and Peter Szolovits, editors, Proceedings of the Tenth National Conference on Artificial Intelligence, pages 440–446, Menlo Park, California, 1992. American Association for Artificial Intelligence, AAAI Press.
Thomas Stützle. Local Search Algorithms for Combinatorial Problems-Analysis, Algorithms and New Applications. DISKI-Dissertationen zur Künstliken Intelligenz. infix, 1999.
Stefan Voss, Silvano Martello, Ibrahim H. Osman, and Catherine Roucairol, editors. Meta-Heuristics-Advances and Trends in Local Search Paradigms for Optimization. Kluwer Academic Publishers, 1999.
Benjamin W. Wah and Yi Shang. Discrete Lagrangian-Based Search for Solving MAX-SAT Problems. In Proc. 15th Int’l Joint Conf. on Artificial Intelligence, IJCAI, pages 378–383, Aug. 1997.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Roli, A., Blum, C. (2001). Critical Parallelization of Local Search for MAX-SAT. In: Esposito, F. (eds) AI*IA 2001: Advances in Artificial Intelligence. AI*IA 2001. Lecture Notes in Computer Science(), vol 2175. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45411-X_16
Download citation
DOI: https://doi.org/10.1007/3-540-45411-X_16
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42601-1
Online ISBN: 978-3-540-45411-3
eBook Packages: Springer Book Archive