Package ec.gp.breed

Class Summary

Class	Description
GPBreedDefaults	A static class that returns the base for "default values" which various GP breeding operators use, rather than making the user specify them all on a per- species basis.
InternalCrossoverPipeline	InternalCrossoverPipeline picks two subtrees from somewhere within an individual, and crosses them over.
MutateAllNodesPipeline	MutateAllNodesPipeline implements the AllNodes mutation algorithm described in Kumar Chellapilla, "A Preliminary Investigation into Evolving Modular Programs without Subtree Crossover", GP98.
MutateDemotePipeline	MutateDemotePipeline works very similarly to the DemoteNode algorithm described in Kumar Chellapilla, "A Preliminary Investigation into Evolving Modular Programs without Subtree Crossover", GP98, and is also similar to the "insertion" operator found in Una-May O'Reilly's thesis, "An Analysis of Genetic Programming".
MutateERCPipeline	MutateERCPipeline works very similarly to the "Gaussian" algorithm described in Kumar Chellapilla, "A Preliminary Investigation into Evolving Modular Programs without Subtree Crossover", GP98.
MutateOneNodePipeline	MutateOneNodesPipeline implements the OneNode mutation algorithm described in Kumar Chellapilla, "A Preliminary Investigation into Evolving Modular Programs without Subtree Crossover", GP98.
MutatePromotePipeline	MutatePromotePipeline works very similarly to the PromoteNode algorithm described in Kumar Chellapilla, "A Preliminary Investigation into Evolving Modular Programs without Subtree Crossover", GP98, and is also similar to the "deletion" operator found in Una-May O'Reilly's thesis, "An Analysis of Genetic Programming".
MutateSwapPipeline	MutateSwapPipeline works very similarly to the Swap algorithm described in Kumar Chellapilla, "A Preliminary Investigation into Evolving Modular Programs without Subtree Crossover", GP98.
RehangPipeline	RehangPipeline picks a nonterminal node other than the root and "rehangs" it as a new root.
SizeFairCrossoverPipeline	SizeFairCrossover works similarly to one written in the paper "Size Fair and Homologous Tree Genetic Programming Crossovers" by Langdon (1998).
SizeFairCrossoverPipeline.NodeInfo	Used for O(1) information of number of subtrees
SizeFairCrossoverPipeline.RouletteWheelSelector	Inner class to do a quick Roulette Wheel Selection