  An evolutionary search space can be smoothly transformed via a suitable
change of basis; however, it can be difficult to determine an appropriate
basis. In this paper, a method is proposed to select an optimum basis can be
used to simplify an evolutionary search space in a binary encoding scheme. The
basis search method is based on a genetic algorithm and the fitness evaluation
is based on the epistasis, which is an indicator of the complexity of a genetic
algorithm. Two tests were conducted to validate the proposed method when
applied to two different evolutionary search problems. The first searched for
an appropriate basis to apply, while the second searched for a solution to the
test problem. The results obtained after the identified basis had been applied
were compared to those with the original basis, and it was found that the
proposed method provided superior results.
