Sciweavers

150 search results - page 2 / 30
» Numeric Mutation: Improved Search in Genetic Programming
Sort
View
CEC
2005
IEEE
13 years 11 months ago
On improving genetic programming for symbolic regression
This paper reports an improvement to genetic programming (GP) search for the symbolic regression domain, based on an analysis of dissimilarity and mating. GP search is generally di...
Steven Gustafson, Edmund K. Burke, Natalio Krasnog...
GECCO
2006
Springer
200views Optimization» more  GECCO 2006»
13 years 9 months ago
A new approach for shortest path routing problem by random key-based GA
In this paper, we propose a Genetic Algorithm (GA) approach using a new paths growth procedure by the random key-based encoding for solving Shortest Path Routing (SPR) problem. An...
Mitsuo Gen, Lin Lin
CEC
2007
IEEE
13 years 7 months ago
Random search can outperform mutation
— Efficient discovery of lowest level building blocks is a fundamental requirement for a successful genetic algorithm. Although considerable effort has been directed at techniqu...
Cameron Skinner, Patricia J. Riddle
SAC
2006
ACM
13 years 11 months ago
Adaptive mutation with fitness and allele distribution correlation for genetic algorithms
In this paper, a new gene based adaptive mutation scheme is proposed for genetic algorithms (GAs), where the information on gene based fitness statistics and on gene based allele...
Shengxiang Yang, Sima Uyar
GECCO
2006
Springer
132views Optimization» more  GECCO 2006»
13 years 9 months ago
"Optimal" mutation rates for genetic search
Using a set of model landscapes we examine how different mutation rates affect different search metrics. We show that very universal heuristics, such as 1/N and the error threshol...
Jorge Cervantes, Christopher R. Stephens