Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

10

PPSN
1998
Springer

favoriteEmaildiscussreport

93views Distributed And Parallel Com...» more PPSN 1998»

Methods to Evolve Legal Phenotypes

13 years 8 months ago

Methods to Evolve Legal Phenotypes

Download www.cs.mun.ca

Many optimization problems require the satisfaction of constraints in addition to their objectives. When using an evolutionary algorithm to solve such problems, these constraints can be enforced in many different ways to ensure that legal solutions (phenotypes) are evolved. We have identified eleven ways to handle constraints within various stages of an evolutionary algorithm. Five of these methods are experimented on a run-time error constraint in a Genetic Programming system. The results are compared and analyzed.

Tina Yu, Peter J. Bentley

Real-time Traffic

Distributed And Parallel Computing | Evolutionary Algorithm | Many Optimization Problems | PPSN 1998 | Run-time Error Constraint |

claim paper

Related Content

» A General Framework for Encoding and Evolving Neural Networks

» Chemical Genetic Programming Coevolution Between Genotypic Strings and Phenotypic Trees

» Evolving Fractal Gene Regulatory Networks for Robot Control

» Evolutionary change in developmental timing

» Theme preservation and the evolution of representation

» Meaningful electronic signatures based on an automatic indexing method

» Sustaining diversity using behavioral information distance

» Evolving Fractal Gene Regulatory Networks for Graceful Degradation of Software

» Towards an empirical measure of evolvability

Post Info
More Details (n/a)

Added	06 Aug 2010
Updated	06 Aug 2010
Type	Conference
Year	1998
Where	PPSN
Authors	Tina Yu, Peter J. Bentley

Comments (0)