期刊名称:International Journal of Computer Science Issues
印刷版ISSN:1694-0784
电子版ISSN:1694-0814
出版年度:2012
卷号:9
期号:6
出版社:IJCSI Press
摘要:This paper provides a robust method for solving transcendental equations. The approach, based on the Genetic Algorithm, is commenced with the evaluation of the mathematical equations by their fitness ratio. As the genetic algorithm is a computationally expensive process, the searching space for possible solutions is limited to possible chromosomes for which the function values are closest to zero. These chromosomes are then selected for the next generation using roulette wheel strategy. Thus, the required processing timing is greatly reduced. Experimental results demonstrate that this process works reliably and gives better results than the well-known False Position method and the Bisection method for the numerical solution of transcendental equations.