A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
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"doi:10.1145/1276958.1277261 dblp:conf/gecco/Stanoyevitch07 fatcat:3nzbt6ebyzeyhoeaebohfhijou