Homogeneous genetic algorithms

Alexander Stanoyevitch
2007 Proceedings of the 9th annual conference on Genetic and evolutionary computation - GECCO '07  
In this note, we briefly describe a new type of genetic algorithm that is designed to mitigate one or both of the following two major difficulties that traditional genetic algorithms may suffer: 1. When the number of "active genes" needs to be held constant or kept within some prescribed range, and 2. When the set of genes is much larger than the set of active genes of feasible solutions under consideration. These homogeneous genetic algorithms use (unordered) sets to represent "active genes"
more » ... chromosomes rather than strings, and accordingly the selection, mating and mutation operators are (naturally) defined using settheoretic operations. Homogeneous GAs have significantly outperformed traditional genetic algorithms for some typical problems in which these difficulties arise.
doi:10.1145/1276958.1277261 dblp:conf/gecco/Stanoyevitch07 fatcat:3nzbt6ebyzeyhoeaebohfhijou