Skip Nav Destination
Close Modal
Update search
NARROW
Format
Journal
Date
Availability
1-4 of 4
Wolfgang Banzhaf
Close
Follow your search
Access your saved searches in your account
Would you like to receive an alert when new items match your search?
Sort by
Journal Articles
Cross-Representation Genetic Programming: A Case Study on Tree-Based and Linear Representations
UnavailablePublisher: Journals Gateway
Evolutionary Computation 1–28.
Published: 11 July 2025
Abstract
View articletitled, Cross-Representation Genetic Programming: A Case Study on Tree-Based and Linear Representations
View
PDF
for article titled, Cross-Representation Genetic Programming: A Case Study on Tree-Based and Linear Representations
Existing genetic programming (GP) methods are typically designed based on a certain representation, such as tree-based or linear representations. These representations show various pros and cons in different domains. However, due to the complicated relationships among representation and fitness landscapes of GP, it is hard to intuitively determine which GP representation is the most suitable for solving a certain problem. Evolving programs (or models) with multiple representations simultaneously can alternatively search on different fitness landscapes since representations are highly related to the search space that essentially defines the fitness landscape. Fully using the latent synergies among different GP individual representations might be helpful for GP to search for better solutions. However, existing GP literature rarely investigates the simultaneous effective evolution of multiple representations. To fill this gap, this paper proposes a cross-representation GP algorithm based on tree-based and linear representations, which are two commonly used GP representations. In addition, we develop a new cross-representation crossover operator to harness the interplay between tree-based and linear representations. Empirical results show that navigating the learned knowledge between basic tree-based and linear representations successfully improves the effectiveness of GP with solely tree-based or linear representation in solving symbolic regression and dynamic job shop scheduling problems.
Journal Articles
Publisher: Journals Gateway
Evolutionary Computation (2007) 15 (2): 199–221.
Published: 01 June 2007
Abstract
View articletitled, Reducing the Number of Fitness Evaluations in Graph Genetic Programming Using a Canonical Graph Indexed Database
View
PDF
for article titled, Reducing the Number of Fitness Evaluations in Graph Genetic Programming Using a Canonical Graph Indexed Database
In this paper we describe the genetic programming system GGP operating on graphs and introduce the notion of graph isomorphisms to explain how they influence the dynamics of GP. It is shown empirically how fitness databases can improve the performance of GP and how mapping graphs to a canonical form can increase these improvements by saving considerable evaluation time.
Journal Articles
Publisher: Journals Gateway
Evolutionary Computation (2004) 12 (2): 223–242.
Published: 01 June 2004
Abstract
View articletitled, Dynamic Subset Selection Based on a Fitness Case Topology
View
PDF
for article titled, Dynamic Subset Selection Based on a Fitness Case Topology
A large training set of fitness cases can critically slow down genetic programming, if no appropriate subset selection method is applied. Such a method allows an individual to be evaluated on a smaller subset of fitness cases. In this paper we suggest a new subset selection method that takes the problem structure into account, while being problem independent at the same time. In order to achieve this, information about the problem structure is acquired during evolutionary search by creating a topology (relationship) on the set of fitness cases. The topology is induced by individuals of the evolving population. This is done by increasing the strength of the relation between two fitness cases, if an individual of the population is able to solve both of them. Our new topology—based subset selection method chooses a subset, such that fitness cases in this subset are as distantly related as is possible with respect to the induced topology. We compare topology—based selection of fitness cases with dynamic subset selection and stochastic subset sampling on four different problems. On average, runs with topology—based selection show faster progress than the others.
Journal Articles
Publisher: Journals Gateway
Evolutionary Computation (1998) 6 (4): iii–vi.
Published: 01 December 1998