Sciweavers

229 search results - page 2 / 46
» Potential fitness for genetic programming
Sort
View
EVOW
2007
Springer
13 years 11 months ago
Tackling the Container Loading Problem: A Hybrid Approach Based on Integer Linear Programming and Genetic Algorithms
Abstract. This paper presents a novel hybrid approach for solving the Container Loading (CL) problem based on the combination of Integer Linear Programming (ILP) and Genetic Algori...
Napoleão Nepomuceno, Plácido Rog&eac...
FOGA
1990
13 years 6 months ago
A Hierarchical Approach to Learning the Boolean Multiplexer Function
This paper describes the recently developed genetic programming paradigm which genetically breeds populations of computer programs to solve problems. In genetic programming, the i...
John R. Koza
GECCO
2004
Springer
13 years 10 months ago
Fitness Clouds and Problem Hardness in Genetic Programming
This paper presents an investigation of genetic programming fitness landscapes. We propose a new indicator of problem hardness for tree-based genetic programming, called negative ...
Leonardo Vanneschi, Manuel Clergue, Philippe Colla...
GECCO
2007
Springer
293views Optimization» more  GECCO 2007»
13 years 11 months ago
Solving the artificial ant on the Santa Fe trail problem in 20, 696 fitness evaluations
In this paper, we provide an algorithm that systematically considers all small trees in the search space of genetic programming. These small trees are used to generate useful subr...
Steffen Christensen, Franz Oppacher
GECCO
2005
Springer
132views Optimization» more  GECCO 2005»
13 years 10 months ago
Dormant program nodes and the efficiency of genetic programming
In genetic programming, there is a tendency for individuals in a population to accumulate fragments of code – often called introns – which are redundant in the fitness evaluat...
David Jackson