Evolutionary programming made faster
IEEE Transactions on Evolutionary Computation
Hi-index | 0.00 |
This article proposes a novel genetic algorithm (GA) which switches the expression of the solution from a redundant binary number to a usual binary number. Furthermore, a GA which switches the expression from the Gray code to the usual binary number is proposed and compared. Comparisons of the performances among five GAs (binary number, redundant binary number, Gray code, switching from redundant binary number to binary number, switching from Gray code to binary number) are illustrated. The performances are evaluated by solving some equations. It is confirmed that the proposed GA effectively decreases the error rate.