| |
| By introducing a criterion based on order-1 building blocks, a framework is established for comparing different choices of the cardinalities of the coding alphabets of the genetic algorithms (GA’s) applied to single-periodical and multiple-periodical fitness functions. It is shown that the genetic algorithms sample the search spaces simultaneously with multiple sampling periods. Thus, by properly choosing the cardinalities in terms of the periods of the fitness functions, order-1 building blocks can be obtained on the corresponding fixed positions of the strings of the GA’s. Thereafter, in the simulations, survival and domination rates of the order-1 schemata are introduced to compare the performance of the genetic algorithms with different cardinalities of the coding alphabets. The simulation results demonstrate the effectiveness of the framework.
|
|
| Keywords:genetic algorithms, coding, function period, cardinality of coding alphabet |
|
