Application of Genetic Algorithm in Solving Linear Equation Systems
چکیده
There are several algorithms for solving linear system of equations. Iteration algorithms are recommended for the large linear systems with sparse matrix. But in the case of general n x m matrices, the classic iterative algorithms are not applicable with a few exceptions. So, In this paper, we have used genetic algorithms to find the solution of a system of linear equations since it is difficult to describe the solution set of a linear system with infinitely many solutions. To avoid the disadvantages of solving large system of linear equations such as rounding errors, inverting large matrixes, the genetic algorithms are introduced. The obtained results indicate that a GA is effective and represents an efficient approach to solve the systems of linear equations. When we use G.A. in solving linear system, we see that the solution is almost equal to the analytical one. Nevertheless on using the G.A. to solve linear system we obtain the result very swiftly. Index Term-Crossover, Fitness Function, Genetic Algorithms Mutation, Optimization Problem, Simple Genetic Algorithm