tournament: tournament selection

In lixiao0214/GA: Genetic Algorithms package for STAT243 course

Description

the set of parents in generation t is randomly partitioned into k disjoint subsets of equal size(perhaps with a few remaining parents temporarily ignored) The best individual in each group is chosen as a parent. Additional random partitionings are carried out until sufficient parents have been generated.Parents are then paired randomly for breeding.

Usage

tournament(originalparents, couplenum, subsetnum, fitness)

Arguments

originalparents	a casenum * variablenum matrix
couplenum	number of couples selected
subsetnum	partition the set of chromosomes in generation t into "subsetnum" disjoint subsets
fitness	goodness of fit ~ a casenum * 1 vector , default is AICvalue

Value

Returns the selected parents ~ list

Author(s)

Lei Zhang

lixiao0214/GA documentation built on May 3, 2019, 7:06 p.m.