An enhanced operator-oriented genetic search algorithm

Abstract

This paper proposes a new search process incorporated into an operator-oriented genetic algorithm (GA). The new search algorithm solves problems in the context of invertible symbolic operations on a combinational finite state environment. The algorithm exploits the GA's ability to search for solutions without regard to a priori knowledge of the problem domain. The validity of the algorithm is illustrated by solving Rubik's cube.<>