| bsearchmut1 {adana} | R Documentation |
Boundary Search Mutation 1
Description
Boundary Search Mutation-1 is an algorithm based on probing the boundaries of the convenience region in constraint processing for NLP optimization (Michalewicz & Schoenauer, 1996). Two genes are randomly selected from the chromosome and one of them is multiplied by a random factor at the q value, while the other gene is multiplied by 1/q.
This operator is used for value encoded (integer or real number) chromosomes.
Usage
bsearchmut1(y, mutq, ...)
Arguments
y |
A vector. Chromosome of the offspring |
mutq |
A number. Value of q |
... |
Further arguments passed to or from other methods. |
Value
mutant |
A vector. Chromosome of the offspring |
mutgen |
A vector. The numbers of the mutated genes. |
Author(s)
Zeynel Cebeci & Erkut Tekeli
References
Michalewicz, Z. and Schoenauer, M. (1996). Evolutionary algorithms for constrained parameter optimization problems. Evolutionary Computation, 4(1), 1-32.
See Also
mutate,
bitmut,
randmut,
randmut2,
randmut3,
randmut4,
unimut,
boundmut,
nunimut,
nunimut2,
powmut,
powmut2,
gaussmut,
gaussmut2,
gaussmut3,
bsearchmut2,
swapmut,
invmut,
shufmut,
insmut,
dismut,
invswapmut,
insswapmut,
invdismut
Examples
offspring = c(8, 6, 4, 1, 3)
#set.seed(12)
bsearchmut1(offspring)
mutq = 0.5
#set.seed(12)
bsearchmut1(offspring, mutq=mutq)