Advertisement

Genetic Programming and Evolvable Machines

, Volume 2, Issue 2, pp 165–191 | Cite as

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

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

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.

problem difficulty test problems fitness landscapes GP theory 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Kluwer Academic Publishers 2001

Authors and Affiliations

  • Jason M. Daida
    • 1
  • Robert R. Bertram
    • 1
  • Stephen A. Stanhope
    • 1
  • Jonathan C. Khoo
    • 1
  • Shahbaz A. Chaudhary
    • 1
  • Omer A. Chaudhri
    • 1
  • John A. II Polito
    • 2
  1. 1.Artificial Intelligence Laboratory and Space Physics Research LaboratoryThe University of MichiganAnn ArborUSA
  2. 2.Consilient, Inc.BerkeleyUSA

Personalised recommendations