Solution to Quadratic Equation Using Genetic Algorithm
Solving Quadratic equation is one of the intrinsic interests as it is the simplest nonlinear equations. A novel approach for solving Quadratic Equation based on Genetic Algorithms (GAs) is presented. Genetic Algorithms (GAs) are a technique to solve problems which need optimization. Generation of trial solutions have been formed by this method. Many examples have been worked out, and in most cases we find out the exact solution. We have discussed the effect of different parameters on the performance of the developed algorithm. The results are concluded after rigorous testing on different equations.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Solving Poisson Equation by Genetic Algorithms
This paper deals with a method for solving Poisson Equation (PE) based on genetic algorithms and grammatical evolution. The method forms generations of solutions expressed in an analytical form. Several examples of PE ar…
FormA Comparative Study of Meta-heuristic Algorithms for Solving Quadratic Assignment Problem
Quadratic Assignment Problem (QAP) is an NP-hard combinatorial optimization problem, therefore, solving the QAP requires applying one or more of the meta-heuristic algorithms. This paper presents a comparative study betw…
Combinatorial OptimizationGenetic Programming Based Symbolic Regression for Analytical Solutions to Differential Equations
In this paper, we present a machine learning method for the discovery of analytic solutions to differential equations. The method utilizes an inherently interpretable algorithm, genetic programming based symbolic regress…
regressionSymbolic RegressionUse of a genetic algorithm to find solutions to introductory physics problems
In this work, we show how a genetic algorithm (GA) can be used to find step-by-step solutions to introductory physics problems. Our perspective is that the underlying task for this is one of finding a sequence of equatio…
A Genetic Algorithm Meta-Heuristic for a Generalized Quadratic Assignment Problem
The generalized quadratic assignment problem (GQAP) is one of the hardest problems to solve in the operations research area. The GQAP addressed in this work is defined as the task of minimizing the assignment and transpo…