A new method for matrix description of genetic algorithms

In this paper, a new method providing an efficient simulation of genetic algorithms through an alternative description of them is introduced. It is based on the representation of each step of the algorithm by means of suitable matrix operations, where each matrix depends basically from population size and from initial parameters settings. The algorithm is therefore rewritten as an autonomous nonlinear discrete system