Abstract
Random Boolean Satisfiability function generators have recently been proposed as tools for studying genetic algorithm behavior. Yet MAXSAT problems exhibit extremely limited epistasis. Furthermore, all nonzero Walsh coefficients can be computed exactly for MAXSAT problems in polynomial time using only the clause information. This means the low order schema averages can be computed quickly and exactly for very large MAXSAT problems. But unless P=NP, this low order information cannot reliably lead to the global optimum, thus nontrivial MAXSAT problems must be deceptive.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
P. Cheeseman, B. Kanefsky, and W. M. Taylor. Where the really hard problems are. In Proc. Twelfth International Joint Conference on Artificial Intelligence, 1991.
M. Davis and H Putnam. A computing procedure for quantification theory. Journal of the ACM, 7:201–215, 1960.
J. Frank. A Study of Genetic Algorithms to Find Approximate Solutions to Hard 3CNF Problems. Golden West International Conference on Artificial Intelligence, 1994.
J. Frank, P. Cheeseman, and J. Stutz. When gravity fails: Local search topology. Journal of Artificial Intelligence Research, 7:249–281, 1997.
D. Goldberg. Genetic algorithms and walsh functions: Part I, a gentle introduction. Complex Systems, 3:129–152, 1989.
D. Goldberg. Genetic algorithms and walsh functions: Part II, deception and its analysis. Complex Systems, 3:153–171, 1989.
D. Mitchell, B. Selman, and H. Levesque. Hard and easy distribution of sat problems. In Proc. Tenth National Conference on Artificial Intelligence, San Jose, CA, 1992.
S. Rana, R. Heckendorn, and D. Whitley. A tractable walsh analysis of Sat and its implications for genetic algorithms. In Proc. Fifteenth National Conference on Artificial Intelligence, 1998.
C. Reeves and C. Wright. Epistasis in genetic algorithms: An experimental design perspective. In Larry Eshelman, editor, Proceedings of the Sixth International Conference on Genetic Algorithms, pages 217–224. Morgan Kaufmann, 1995.
B. Selman, H. Levesque, and D. Mitchell. A new method for solving hard satisfiability problems. In Proc. Tenth National Conference on Artificial Intelligence, pages 440–446, San Jose, CA, 1992.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rana, S., Whitley, D. (1998). Genetic algorithm behavior in the MAXSAT domain. In: Eiben, A.E., Bäck, T., Schoenauer, M., Schwefel, HP. (eds) Parallel Problem Solving from Nature — PPSN V. PPSN 1998. Lecture Notes in Computer Science, vol 1498. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0056920
Download citation
DOI: https://doi.org/10.1007/BFb0056920
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65078-2
Online ISBN: 978-3-540-49672-4
eBook Packages: Springer Book Archive