844 search results - page 79 / 169 » Generalized crowding for genetic algorithms |
GECCO
2005
Springer
15 years 3 months ago
2005
Springer
We introduce a clustering-based method of subpopulation management in genetic programming (GP) called Evolutionary Tree Genetic Programming (ETGP). The biological motivation behin...
GECCO
2010
Springer
15 years 2 months ago
2010
Springer
The original mechanism by which evolutionary algorithms were to solve problems was to allow for the gradual discovery of sub-solutions to sub-problems, and the automated combinati...
GECCO
2009
Springer
15 years 2 months ago
2009
Springer
Shin et al [19] and McKay et al [15] previously applied tree compression and semantics-based simplification to study the distribution of building blocks in evolving Genetic Progr...
GECCO
2008
Springer
14 years 11 months ago
2008
Springer
Genetic Network Programming (GNP) has been proposed as a graph-based evolutionary algorithm. GNP works well especially in dynamic environments due to its graph structures. In addi...
62
Voted
GECCO
2007
Springer
15 years 4 months ago
2007
Springer
The deterministic Multi-step Crossover Fusion (dMSXF) is an improved crossover method of MSXF which is a promising method of JSP, and it shows high availability in TSP. Both of th...