What Makes a Problem GP-Hard? Analysis of a Tunably Difficult Problem in Genetic Programming

Daida, Jason M.; Bertram, Robert R.; Stanhope, Stephen A.; Khoo, Jonathan C.; Chaudhary, Shahbaz A.; Chaudhri, Omer A.; Polito, John A. II.

2001-06

Citation: Daida, Jason M.; Bertram, Robert R.; Stanhope, Stephen A.; Khoo, Jonathan C.; Chaudhary, Shahbaz A.; Chaudhri, Omer A.; Polito, John A. II; (2001). "What Makes a Problem GP-Hard? Analysis of a Tunably Difficult Problem in Genetic Programming." Genetic Programming and Evolvable Machines 2 (2): 165-191. <http://hdl.handle.net/2027.42/45613>

Abstract: This paper addresses the issue of what makes a problem genetic programming (GP)-hard by considering the binomial-3 problem. In the process, we discuss the efficacy of the metaphor of an adaptive fitness landscape to explain what is GP-hard. We indicate that, at least for this problem, the metaphor is misleading.

ISSN: 1389-2576, 1573-7632

DOIs: http://dx.doi.org/10.1023/A:1011504414730

Handle: http://hdl.handle.net/2027.42/45613

Show full item record