Title:	Binary Gene Operations for Genetic Algorithms
Version:	1.0.0.2
Description:	Representation-dependent gene level operations of a genetic algorithm with binary coded genes: Initialization of random binary genes, several gene maps for binary genes, several mutation operators, several crossover operators with 1 and 2 kids, replication pipelines for 1 and 2 kids, and, last but not least, function factories for configuration. See Goldberg, D. E. (1989, ISBN:0-201-15767-5). For crossover operators, see Syswerda, G. (1989, ISBN:1-55860-066-3), Spears, W. and De Jong, K. (1991, ISBN:1-55860-208-9). For mutation operators, see Stanhope, S. A. and Daida, J. M. (1996, ISBN:0-18-201-031-7).
License:	MIT + file LICENSE
URL:	https://github.com/ageyerschulz/xegaGaGene
Encoding:	UTF-8
RoxygenNote:	7.3.2
Suggests:	testthat (≥ 3.0.0)
Imports:	xegaSelectGene
NeedsCompilation:	no
Packaged:	2025-04-16 09:56:18 UTC; dj2333
Author:	Andreas Geyer-Schulz [aut, cre]
Maintainer:	Andreas Geyer-Schulz <Andreas.Geyer-Schulz@kit.edu>
Repository:	CRAN
Date/Publication:	2025-04-16 10:50:02 UTC

Package xegaGaGene.

Description

Genetic operations for binary coded genetic algorithms.

Details

For an introduction to this class of algorithms, see Goldberg, D. (1989).

For binary-coded genes, the xegaGaGene package provides

• Gene initiatilization.

• Decoding of parameters as well as a function factory for configuration.

• Mutation functions as well as a function factory for configuration.

• Crossover functions as well as a function factory for configuration. We provide two families of crossover functions:

  1. Crossover functions with two kids: Crossover preserves the genetic information in the gene pool.

  2. Crossover functions with one kid: These functions allow the construction of gene evaluation pipelines. One advantage of this is a simple control structure at the population level.

  3. Gene replication functions as well as a function factory for configuration. The replication functions implement control flows for sequences of gene operations. For xegaReplicateGene, an acceptance step has been added. Simulated annealing algorithms can be configured e.g. by configuring uniform random selection combined with a Metropolis Acceptance Rule and a suitable cooling schedule.

Binary Gene Representation

A binary gene is a named list:

• $gene1 the gene must be a binary vector.

• $fit the fitness value of the gene (for EvalGeneDet and EvalGeneU) or the mean fitness (for stochastic functions evaluated with EvalGeneStoch).

• $evaluated has the gene been evaluated?

• $evalFail has the evaluation of the gene failed?

• $var the cumulative variance of the fitness of all evaluations of a gene. (For stochastic functions)

• $sigma the standard deviation of the fitness of all evaluations of a gene. (For stochastic functions)

• $obs the number of evaluations of a gene. (For stochastic functions)

Abstract Interface of Problem Environment

A problem environment penv must provide:

• $f(parameters, gene, lF): Function with a real parameter vector as first argument which returns a gene with evaluated fitness.

• $genelength(): The number of bits of the binary-coded real parameter vector. Used in InitGene.

• $bitlength(): A vector specifying the number of bits used for coding each real parameter. If penv$bitlength()[1] is 20, then parameters[1] is coded by 20 bits. Used in GeneMap.

• $lb(): The lower bound vector of each parameter. Used in GeneMap.

• $ub(): The upper bound vector of each parameter. Used in GeneMap.

Abstract Interface of Mutation Functions

Each mutation function has the following function signature:

newGene<-Mutate(gene, lF)

All local parameters of the mutation function configured are expected in the local function list lF.

Local Constants of Mutation Functions

The local constants of a mutation function determine the behavior of the function. The default values in the table below are set in lFxegaGaGene.

Abstract Interface of Crossover Functions

The signatures of the abstract interface to the 2 families of crossover functions are:

ListOfTwoGenes<-Crossover2(gene1, gene2, lF)

ListOfOneGene<-Crossover(gene1, gene2, lF)

All local parameters of the crossover function configured are expected in the local function list lF.

Local Constants of Crossover Functions

The local constants of a crossover function determine the the behavior of the function.

Abstract Interface of Gene Replication Functions

The signatures of the abstract interface to the 2 gene replication functions are:

ListOfTwoGenes<-Replicate2Gene(gene1, gene2, lF)

ListOfOneGene<-ReplicateGene(gene1, gene2, lF)

Configuration and Constants of Replication Functions

Configuration for ReplicateGene (1 Kid, Default).

Configuration for Replicate2Gene (2 Kids).

Global Constants.

Global constants specify the probability that a mutation or crossover operator is applied to a gene. In the xega-architecture, these rates can be configured to be adaptive.

Local Constants.

In the xega-architecture, these rates can be configured to be adaptive.

The Architecture of the xegaX-Packages

The xegaX-packages are a family of R-packages which implement eXtended Evolutionary and Genetic Algorithms (xega). The architecture has 3 layers, namely the user interface layer, the population layer, and the gene layer:

• The user interface layer (package xega) provides a function call interface and configuration support for several algorithms: genetic algorithms (sga), permutation-based genetic algorithms (sgPerm), derivation-free algorithms as e.g. differential evolution (sgde), grammar-based genetic programming (sgp) and grammatical evolution (sge).

• The population layer (package xegaPopulation) contains population-related functionality as well as support for population statistics dependent adaptive mechanisms and parallelization.

• The gene layer is split into a representation-independent and a representation-dependent part:

  1. The representation indendent part (package xegaSelectGene) is responsible for variants of selection operators, evaluation strategies for genes, as well as profiling and timing capabilities.

  2. The representation dependent part consists of the following packages:

     • xegaGaGene for binary coded genetic algorithms.

     • xegaPermGene for permutation-based genetic algorithms.

     • xegaDfGene for derivation-free algorithms as e.g. differential evolution.

     • xegaGpGene for grammar-based genetic algorithms.

     • xegaGeGene for grammatical evolution algorithms.

     The packages xegaDerivationTrees and xegaBNF support the last two packages: xegaBNF essentially provides a grammar compiler, and xegaDerivationTrees is an abstract data type for derivation trees.

Copyright

(c) 2023 Andreas Geyer-Schulz

License

MIT

URL

<https://github.com/ageyerschulz/xegaGaGene>

Installation

From CRAN by install.packages('xegaGaGene')

Author(s)

Andreas Geyer-Schulz

References

Goldberg, David E. (1989) Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley, Reading. (ISBN:0-201-15767-5)

See Also

Useful links:

• https://github.com/ageyerschulz/xegaGaGene

Map Gray code to binary.

Description

Map Gray code to binary.

Usage

Gray2Bin(x)

Arguments

Details

Start with the highest order bit, and r[k-i]<- xor(n[k], n[k-1]).

Value

Binary code (boolean vector).

References

Gray, Frank (1953): Pulse Code Communication. US Patent 2 632 058.

Examples

 Gray2Bin(c(1, 0, 0, 0))
 Gray2Bin(c(1, 1, 1, 1))

The local function list lFxegaGaGene.

Description

We enhance the configurability of our code by introducing a function factory. The function factory contains all the functions that are needed for defining local functions in genetic operators. The local function list keeps the signatures of functions (e.g. mutation functions) uniform and small. At the same time, variants of functions can use different local functions.

Usage

lFxegaGaGene

Format

An object of class list of length 29.

Details

We use the local function list for

1. replacing all constants by constant functions.

   Rationale: We need one formal argument (the local function list lF) and we can dispatch multiple functions. E.g. lF$verbose()

2. dynamically binding a local function with a definition from a proper function factory. E.g., the selection methods lF$SelectGene() and lF$SelectMate().

3. gene representations which require special functions to handle them: lF$InitGene(), lF$DecodeGene(), lF$EvalGene(), lF$ReplicateGene(), ...

See Also

Other Configuration: xegaGaCrossoverFactory(), xegaGaGeneMapFactory(), xegaGaMutationFactory(), xegaGaReplicationFactory()

Returns elements of vector x without elements in y.

Description

Returns elements of vector x without elements in y.

Usage

without(x, y)

Arguments

Value

A vector.

Examples

a<-sample(1:15,15, replace=FALSE)
b<-c(1, 3, 5)
without(a, b)

One point crossover of 2 genes.

Description

xegaGaCross2Gene() randomly determines a cut point. It combines the bits before the cut point of the first gene with the bits after the cut point from the second gene (kid 1). It combines the bits before the cut point of the second gene with the bits after the cut point from the first gene (kid 2). It returns 2 genes.

Usage

xegaGaCross2Gene(gg1, gg2, lF)

Arguments

Value

A list of 2 binary genes.

See Also

Other Crossover (Returns 2 Kids): xegaGaUCross2Gene(), xegaGaUPCross2Gene()

Examples

gene1<-xegaGaInitGene(lFxegaGaGene)
gene2<-xegaGaInitGene(lFxegaGaGene)
xegaGaDecodeGene(gene1, lFxegaGaGene)
xegaGaDecodeGene(gene2, lFxegaGaGene)
newgenes<-xegaGaCross2Gene(gene1, gene2, lFxegaGaGene)
xegaGaDecodeGene(newgenes[[1]], lFxegaGaGene)
xegaGaDecodeGene(newgenes[[2]], lFxegaGaGene)

One point crossover of 2 genes.

Description

xegaGaCrossGene() randomly determines a cut point. It combines the bits before the cut point of the first gene with the bits after the cut point from the second gene (kid 1).

Usage

xegaGaCrossGene(gg1, gg2, lF)

Arguments

Value

A list of one binary gene.

See Also

Other Crossover (Returns 1 Kid): xegaGaUCrossGene(), xegaGaUPCrossGene()

Examples

gene1<-xegaGaInitGene(lFxegaGaGene)
gene2<-xegaGaInitGene(lFxegaGaGene)
xegaGaDecodeGene(gene1, lFxegaGaGene)
xegaGaDecodeGene(gene2, lFxegaGaGene)
gene3<-xegaGaCrossGene(gene1, gene2, lFxegaGaGene)
xegaGaDecodeGene(gene3[[1]], lFxegaGaGene)

Configure the crossover function of a genetic algorithm.

Description

xegaGaCrossoverFactory() implements the selection of one of the crossover functions in this package by specifying a text string. The selection fails ungracefully (produces a runtime error) if the label does not match. The functions are specified locally.

Current support:

1. Crossover functions with two kids:

   1. "Cross2Gene" returns xegaGaCross2Gene().

   2. "UCross2Gene" returns xegaGaUCross2Gene().

   3. "UPCross2Gene" returns xegaGaUPCross2Gene().

2. Crossover functions with one kid:

   1. "CrossGene" returns xegaGaCrossGene().

   2. "UCrossGene" returns xegaGaUCrossGene().

   3. "UPCrossGene" returns xegaGaUPCrossGene().

Usage

xegaGaCrossoverFactory(method = "Cross2Gene")

Arguments

Details

Crossover operations which return 2 kids preserve the genetic material in the population. However, because we work with fixed size populations, genes with 2 offsprings fill two slots in the new population with their genetic material.

Value

A crossover function for genes.

See Also

Other Configuration: lFxegaGaGene, xegaGaGeneMapFactory(), xegaGaMutationFactory(), xegaGaReplicationFactory()

Examples

XGene<-xegaGaCrossoverFactory("Cross2Gene")
gene1<-xegaGaInitGene(lFxegaGaGene)
gene2<-xegaGaInitGene(lFxegaGaGene)
XGene(gene1, gene2, lFxegaGaGene)

Decode a gene.

Description

xegaGaDecodeGene() decodes a binary gene.

Usage

xegaGaDecodeGene(gene, lF)

Arguments

Value

The decoded gene (the phenotype).

See Also

Other Decoder: xegaGaGeneMap(), xegaGaGeneMapGray(), xegaGaGeneMapIdentity(), xegaGaGeneMapPerm()

Examples

gene<-xegaGaInitGene(lFxegaGaGene)
xegaGaDecodeGene(gene, lFxegaGaGene)

Map the bit strings of a binary gene to parameters in an interval.

Description

xegaGaGeneMap() maps the bit strings of a binary string to parameters in an interval. Bit vectors are mapped into equispaced numbers in the interval. Examples: Optimization of problems with real-valued parameter vectors.

Usage

xegaGaGeneMap(gene, penv)

Arguments

Value

The decoded gene (the phenotype).

See Also

Other Decoder: xegaGaDecodeGene(), xegaGaGeneMapGray(), xegaGaGeneMapIdentity(), xegaGaGeneMapPerm()

Examples

gene<-xegaGaInitGene(lFxegaGaGene)
xegaGaGeneMap(gene$gene1, lFxegaGaGene$penv)

Configure the gene map function of a genetic algorithm.

Description

xegaGaGeneMapFactory() implements the selection of one of the GeneMap functions in this package by specifying a text string. The selection fails ungracefully (produces a runtime error) if the label does not match. The functions are specified locally.

Current support:

1. "Bin2Dec" returns xegaGaGeneMap(). (Default).

2. "Gray2Dec" returns xegaGaGeneMapGray().

3. "Identity" returns xegaGaGeneMapIdentity().

4. "Permutation" returns xegaGaGeneMapPerm().

Usage

xegaGaGeneMapFactory(method = "Bin2Dec")

Arguments

Value

A gene map function for genes.

See Also

Other Configuration: lFxegaGaGene, xegaGaCrossoverFactory(), xegaGaMutationFactory(), xegaGaReplicationFactory()

Examples

XGene<-xegaGaGeneMapFactory("Identity")
gene<-xegaGaInitGene(lFxegaGaGene)
XGene(gene$gene1, lFxegaGaGene$penv)

Map the bit strings of a gray-coded gene to parameters in an interval.

Description

xegaGaGeneMapGray() maps the bit strings of a binary string interpreted as Gray codes to parameters in an interval. Bit vectors are mapped into equispaced numbers in the interval. Examples: Optimization of problems with real-valued parameter vectors.

Usage

xegaGaGeneMapGray(gene, penv)

Arguments

Value

The decoded gene (the phenotype).

See Also

Other Decoder: xegaGaDecodeGene(), xegaGaGeneMap(), xegaGaGeneMapIdentity(), xegaGaGeneMapPerm()

Examples

gene<-xegaGaInitGene(lFxegaGaGene)
xegaGaGeneMapGray(gene$gene1, lFxegaGaGene$penv)

Map the bit strings of a binary gene to an identical bit vector.

Description

xegaGaGeneMapIdentity() maps the bit strings of a binary vector to an identical binary vector. Faster for all problems with single-bit coding. Examples: Knapsack, Number Partitioning into 2 partitions.

Usage

xegaGaGeneMapIdentity(gene, penv)

Arguments

Value

A binary gene (the phenotype).

See Also

Other Decoder: xegaGaDecodeGene(), xegaGaGeneMap(), xegaGaGeneMapGray(), xegaGaGeneMapPerm()

Examples

gene<-xegaGaInitGene(lFxegaGaGene)
xegaGaGeneMapIdentity(gene$gene1, lFxegaGaGene$penv)

Map the bit strings of a binary gene to a permutation.

Description

xegaGaGeneMapPerm() maps the bit strings of a binary string to a permutation of integers. Example: Traveling Salesman Problem (TSP).

Usage

xegaGaGeneMapPerm(gene, penv)

Arguments

Value

A permutation (the decoded gene (the phenotype))

See Also

Other Decoder: xegaGaDecodeGene(), xegaGaGeneMap(), xegaGaGeneMapGray(), xegaGaGeneMapIdentity()

Examples

gene<-xegaGaInitGene(lFxegaGaGene)
xegaGaGeneMapPerm(gene$gene1, lFxegaGaGene$penv)

Individually variable adaptive mutation of a gene.

Description

xegaGaIVAdaptiveMutateGene() mutates a binary gene. Two mutation rates (lF$BitMutationRate1() and lF$BitMutationRate2() which is higher than the first) are used depending on the relative fitness of the gene. lF$CutoffFit() and lF$CBestFitness() are used to determine the relative fitness of the gene. The rationale is that mutating genes having a low fitness with a higher probability rate improves the performance of a genetic algorithm, because the gene gets a higher chance to improve.

Usage

xegaGaIVAdaptiveMutateGene(gene, lF)

Arguments

Details

This principle is a candidate for a more abstract implementation, because it applies to all variants of evolutionary algorithms.

The goal is to separate the threshold code and the representation-dependent part and to combine them in the factory properly.

Value

A binary gene

References

Stanhope, Stephen A. and Daida, Jason M. (1996) An Individually Variable Mutation-rate Strategy for Genetic Algorithms. In: Koza, John (Ed.) Late Breaking Papers at the Genetic Programming 1996 Conference. Stanford University Bookstore, Stanford, pp. 177-185. (ISBN:0-18-201-031-7)

See Also

Other Mutation: xegaGaMutateGene()

Examples

parm<-function(x) {function() {return(x)}}
lFxegaGaGene$BitMutationRate1<-parm(1.0)
lFxegaGaGene$BitMutationRate2<-parm(0.5)
gene1<-xegaGaInitGene(lFxegaGaGene)
xegaGaDecodeGene(gene1, lFxegaGaGene)
gene<-xegaGaIVAdaptiveMutateGene(gene1, lFxegaGaGene)
xegaGaDecodeGene(gene, lFxegaGaGene)

Generate a random binary gene.

Description

xegaGaInitGene() generates a random binary gene with a given length.

Usage

xegaGaInitGene(lF)

Arguments

Value

A binary gene (a named list):

• $evaluated: FALSE. See package xegaSelectGene.

• $evalFail: FALSE. Set by the error handler(s) of the evaluation functions in package xegaSelectGene in the case of failure.

• $fit: Fitness.

• $gene1: Binary gene.

Examples

xegaGaInitGene(lFxegaGaGene)

Mutate a gene.

Description

xegaGaMutateGene() mutates a binary gene. The per-bit mutation rate is given by lF$BitMutationRate1().

Usage

xegaGaMutateGene(gene, lF)

Arguments

Value

A binary gene.

See Also

Other Mutation: xegaGaIVAdaptiveMutateGene()

Examples

parm<-function(x) {function() {return(x)}}
lFxegaGaGene$BitMutationRate1<-parm(1.0)
gene1<-xegaGaInitGene(lFxegaGaGene)
xegaGaDecodeGene(gene1, lFxegaGaGene)
lFxegaGaGene$BitMutationRate1()
gene<-xegaGaMutateGene(gene1, lFxegaGaGene)
xegaGaDecodeGene(gene, lFxegaGaGene)

Configure the mutation function of a genetic algorithm.

Description

xegaGaMutationFactory() implements the selection of one of the mutation functions in this package by specifying a text string. The selection fails ungracefully (produces a runtime error) if the label does not match. The functions are specified locally.

Current support:

1. "MutateGene" returns xegaGaMutateGene().

2. "IVM" returns xegaGaIVAdaptiveMutateGene().

Usage

xegaGaMutationFactory(method = "MutateGene")

Arguments

Value

A mutation function for genes.

See Also

Other Configuration: lFxegaGaGene, xegaGaCrossoverFactory(), xegaGaGeneMapFactory(), xegaGaReplicationFactory()

Examples

parm<-function(x) {function() {return(x)}}
lFxegaGaGene$BitMutationRate1<-parm(1.0)
Mutate<-xegaGaMutationFactory("MutateGene")
gene1<-xegaGaInitGene(lFxegaGaGene)
gene1
Mutate(gene1, lFxegaGaGene)

Replicates a gene.

Description

xegaGaReplicate2Gene() replicates a gene by 2 random experiments which determine if a mutation operator (boolean variable mut) and/or a crossover operator (boolean variable cross should be applied. For each of the 4 cases, the appropriate code is executed.

Usage

xegaGaReplicate2Gene(pop, fit, lF)

Arguments

Details

xegaGaReplicate2Gene() implements the control flow by case distinction which depends on the random choices for mutation and crossover:

1. A gene g is selected and the boolean variables mut and cross are set to runif(1)<rate. rate is given by lF$MutationRate() or lF$CrossRate().

2. The truth values of cross and mut determine the code that is executed:

   1. (cross==TRUE) & (mut==TRUE): Mate selection, crossover, mutation.

   2. (cross==TRUE) & (mut==FALSE): Mate selection, crossover.

   3. (cross==FALSE) & (mut==TRUE): Mutation.

   4. (cross==FALSE) & (mut==FALSE) is implicit: Returns a gene list.

Value

A list of either 1 or 2 binary genes.

See Also

Other Replication: xegaGaReplicateGene()

Examples

lFxegaGaGene$CrossGene<-xegaGaCross2Gene
lFxegaGaGene$MutationRate<-function(fit, lF) {0.001}
names(lFxegaGaGene)
pop10<-lapply(rep(0,10), function(x) xegaGaInitGene(lFxegaGaGene))
epop10<-lapply(pop10, lFxegaGaGene$EvalGene, lF=lFxegaGaGene)
fit10<-unlist(lapply(epop10, function(x) {x$fit}))
newgenes<-xegaGaReplicate2Gene(pop10, fit10, lFxegaGaGene)

Replicates a gene.

Description

xegaGaReplicateGene() replicates a gene by applying a gene reproduction pipeline which uses crossover and mutation and finishes with an acceptance rule. The control flow starts by selecting a gene from the population followed by the case distinction:

• Check if the mutation operation should be applied. (mut is TRUE with a probability of lF$MutationRate()).

• Check if the crossover operation should be applied. (cross is TRUE with a probability of lF$CrossRate()).

The state distinction determines which genetic operations are performed.

Usage

xegaGaReplicateGene(pop, fit, lF)

Arguments

Details

xegaGaReplicateGene() implements the control flow by a dynamic definition of the operator pipeline depending on the random choices for mutation and crossover:

1. A gene g is selected and the boolean variables mut and cross are set to runif(1)<rate.

2. The local function for the operator pipeline OPpip(g, lF) is defined by the truth values of cross and mut:

   1. (cross==FALSE) & (mut==FALSE): Identity function.

   2. (cross==TRUE) & (mut==TRUE): Mate selection, crossover, mutation.

   3. (cross==TRUE) & (mut==FALSE): Mate selection, crossover.

   4. (cross==FALSE) & (mut==TRUE): Mutation.

3. Perform the operator pipeline and accept the result. The acceptance step allows the combination of a genetic algorithm with other heuristic algorithms like simulated annealing by executing an acceptance rule. For the genetic algorithm, the identity function is used.

Value

A list of one gene.

See Also

Other Replication: xegaGaReplicate2Gene()

Examples

lFxegaGaGene$CrossGene<-xegaGaCrossGene
lFxegaGaGene$MutationRate<-function(fit, lF) {0.001}
lFxegaGaGene$Accept<-function(OperatorPipeline, gene, lF) {gene}
pop10<-lapply(rep(0,10), function(x) xegaGaInitGene(lFxegaGaGene))
epop10<-lapply(pop10, lFxegaGaGene$EvalGene, lF=lFxegaGaGene)
fit10<-unlist(lapply(epop10, function(x) {x$fit}))
newgenes<-xegaGaReplicateGene(pop10, fit10, lFxegaGaGene)

Configure the replication function of a genetic algorithm.

Description

xegaGaReplicationFactory() implements the selection of a replication method.

Current support:

1. "Kid1" returns xegaGaReplicateGene().

2. "Kid2" returns xegaGaReplicate2Gene().

Usage

xegaGaReplicationFactory(method = "Kid1")

Arguments

Value

A replication function for genes.

See Also

Other Configuration: lFxegaGaGene, xegaGaCrossoverFactory(), xegaGaGeneMapFactory(), xegaGaMutationFactory()

Examples

lFxegaGaGene$CrossGene<-xegaGaCrossGene
lFxegaGaGene$MutationRate<-function(fit, lF) {0.001}
lFxegaGaGene$Accept<-function(OperatorPipeline, gene, lF) {gene}
Replicate<-xegaGaReplicationFactory("Kid1")
pop10<-lapply(rep(0,10), function(x) xegaGaInitGene(lFxegaGaGene))
epop10<-lapply(pop10, lFxegaGaGene$EvalGene, lF=lFxegaGaGene)
fit10<-unlist(lapply(epop10, function(x) {x$fit}))
newgenes1<-Replicate(pop10, fit10, lFxegaGaGene)
lFxegaGaGene$CrossGene<-xegaGaCross2Gene
Replicate<-xegaGaReplicationFactory("Kid2")
newgenes2<-Replicate(pop10, fit10, lFxegaGaGene)

Uniform crossover of 2 genes.

Description

xegaGaUCross2Gene() swaps alleles of both genes with a probability of 0.5. It generates a random mask which is used to build the new genes. It returns 2 genes.

Usage

xegaGaUCross2Gene(gg1, gg2, lF)

Arguments

Value

A list of 2 binary genes.

References

Syswerda, Gilbert (1989): Uniform Crossover in Genetic Algorithms. In: Schaffer, J. David (Ed.) Proceedings of the Third International Conference on Genetic Algorithms, Morgan Kaufmann Publishers, Los Altos, California, pp. 2-9. (ISBN:1-55860-066-3)

See Also

Other Crossover (Returns 2 Kids): xegaGaCross2Gene(), xegaGaUPCross2Gene()

Examples

gene1<-xegaGaInitGene(lFxegaGaGene)
gene2<-xegaGaInitGene(lFxegaGaGene)
xegaGaDecodeGene(gene1, lFxegaGaGene)
xegaGaDecodeGene(gene2, lFxegaGaGene)
newgenes<-xegaGaUCross2Gene(gene1, gene2, lFxegaGaGene)
xegaGaDecodeGene(newgenes[[1]], lFxegaGaGene)
xegaGaDecodeGene(newgenes[[2]], lFxegaGaGene)

Uniform crossover of 2 genes.

Description

xegaGaUCrossGene() swaps alleles of both genes with a probability of 0.5. It generates a random mask which is used to build the new gene.

Usage

xegaGaUCrossGene(gg1, gg2, lF)

Arguments

Value

A list of one binary gene.

References

Syswerda, Gilbert (1989): Uniform Crossover in Genetic Algorithms. In: Schaffer, J. David (Ed.) Proceedings of the Third International Conference on Genetic Algorithms, Morgan Kaufmann Publishers, Los Altos, California, pp. 2-9. (ISBN:1-55860-066-3)

See Also

Other Crossover (Returns 1 Kid): xegaGaCrossGene(), xegaGaUPCrossGene()

Examples

gene1<-xegaGaInitGene(lFxegaGaGene)
gene2<-xegaGaInitGene(lFxegaGaGene)
xegaGaDecodeGene(gene1, lFxegaGaGene)
xegaGaDecodeGene(gene2, lFxegaGaGene)
gene3<-xegaGaUCrossGene(gene1, gene2, lFxegaGaGene)
xegaGaDecodeGene(gene3[[1]], lFxegaGaGene)

Parameterized uniform crossover of 2 genes.

Description

xegaGaUP2CrossGene() swaps alleles of both genes with a probability of lF$UCrossSwap(). It generates a random mask which is used to build the new gene. It returns 2 genes.

Usage

xegaGaUPCross2Gene(gg1, gg2, lF)

Arguments

Value

A list of 2 binary genes.

References

Spears William and De Jong, Kenneth (1991): On the Virtues of Parametrized Uniform Crossover. In: Belew, Richar K. and Booker, Lashon B. (Ed.) Proceedings of the Fourth International Conference on Genetic Algorithms, Morgan Kaufmann Publishers, Los Altos, California, pp. 230-236. (ISBN:1-55860-208-9)

See Also

Other Crossover (Returns 2 Kids): xegaGaCross2Gene(), xegaGaUCross2Gene()

Examples

gene1<-xegaGaInitGene(lFxegaGaGene)
gene2<-xegaGaInitGene(lFxegaGaGene)
xegaGaDecodeGene(gene1, lFxegaGaGene)
xegaGaDecodeGene(gene2, lFxegaGaGene)
newgenes<-xegaGaUPCross2Gene(gene1, gene2, lFxegaGaGene)
xegaGaDecodeGene(newgenes[[1]], lFxegaGaGene)
xegaGaDecodeGene(newgenes[[2]], lFxegaGaGene)

Parameterized uniform crossover of 2 genes.

Description

xegaGaUPCrossGene() swaps alleles of both genes with a probability of lF$UCrossSwap(). It generates a random mask which is used to build the new gene.

Usage

xegaGaUPCrossGene(gg1, gg2, lF)

Arguments

Value

A list of one binary gene.

References

Spears William and De Jong, Kenneth (1991): On the Virtues of Parametrized Uniform Crossover. In: Belew, Richar K. and Booker, Lashon B. (Ed.) Proceedings of the Fourth International Conference on Genetic Algorithms, Morgan Kaufmann Publishers, Los Altos, California, pp. 230-236. (ISBN:1-55860-208-9)

See Also

Other Crossover (Returns 1 Kid): xegaGaCrossGene(), xegaGaUCrossGene()

Examples

gene1<-xegaGaInitGene(lFxegaGaGene)
gene2<-xegaGaInitGene(lFxegaGaGene)
xegaGaDecodeGene(gene1, lFxegaGaGene)
xegaGaDecodeGene(gene2, lFxegaGaGene)
gene3<-xegaGaUPCrossGene(gene1, gene2, lFxegaGaGene)
xegaGaDecodeGene(gene3[[1]], lFxegaGaGene)