GENETIC ALGORITHM IN SOLVING MULTI-DIMENSIONAL POLYNOMIAL FUNCTION FIT TO EXPERIMENTAL DATA

Year 2023, Volume: 6 Issue: 1, 20 - 28, 03.07.2023

Uchenna Igboeli

Abstract

A Polynomial Genetic Algorithm (PGA) is a type of evolutionary algorithm used for optimization problems that involve finding the minimum or maximum of a polynomial function. The algorithm is based on the principles of natural selection and genetic recombination and mutation. The algorithm starts by initializing a random population of chromosomes. The fitness of each chromosome is evaluated based on the value of the polynomial function it represents. The fittest chromosomes are selected for reproduction, and their genetic material is combined through crossover and mutation to produce a new generation of chromosomes. One important consideration in using a genetic algorithm for polynomial optimization is the choice of representation for the chromosomes. Binary or integer representations can be used, with each bit or integer representing a coefficient in the polynomial. Alternatively, a floating-point representation can be used, with each chromosome representing a set of coefficients that can be used to construct the polynomial.
In summary, to solve a polynomial using a genetic algorithm, we need to define a fitness function that evaluates the fitness of each chromosome based on its ability to represent a good solution to the polynomial, and then use standard genetic algorithm techniques to evolve a population of chromosomes towards a solution. The solution found in this paper shows that though genetic algorithm can be used to solve polynomials, other methods like Newton-Ralpson, Secant, Regula-falsi and Bisection can easily guess the solution in a few iterations thereby saving cost and time

Keywords

Polynomial, Algorithm, Chromosomes, Crossover, Mutation, Optimization

References

• BajPai, P., Kumar, M. (1999). Genetic Algorithm – an Approach to Solve Global Optimization Problems, Indian Journal of Computer Science and Engineering, Vol 1 No 3 199-206.
• Hoffmeister, F., Bäck, T. (1991). Genetic Algorithms and evolution strategies: Similarities and differences. Lecture Notes in Computer Science, vol 496. Springer, Berlin, Heidelberg. https://doi.org/10.1007 /BFb0029787.
• Dao, S.D., Abhary, K. & Marian, R. (2017). An improved genetic algorithm for multidimensional optimization of precedence-constrained production planning and scheduling. J Ind Eng Int 13, 143–159. https://doi.org/10.1007/s40092-016-0181-7
• Clegg J., Dawson J., Stuart P., Barley M. (2005). The use of a genetic algorithm to optimize the functional form of a multi- dimensional polynomial fit to experimental data. In: IEEE Congress on Evolutionary Computation, Edinburgh. IEEE Congress on Evolutionary Computation, Edinburgh , pp. 928-934.
• Goldbeg, D. (1999). Genetic Algorithm in Search Optimization and Machine Learning. Addison-Wesley Publishing Co.inc.
• Chudasama, C., Shah, S., Panchal, M. (2011). Comparison of Parents Selection Methods of Genetic Algorithm for TSP. Proceeding published by International Journal of Computer Application (IJCA). International Conference on Computer Communication and Network CSI-COMNET-2011.
• Diaz-Gomez, P., Hougen, D. F. (2007). Initial population for genetic algorithms: a metric approacs. In: Proceedings of the 2007 International Conference on Genetic and Evolutionary Methods, GEM, Nevada, USA. 2007; pp. 55–63.
• Kour, H., Sharma, P., Abrol, P. (2015). Analysis of fitness function in genetic algorithms, Journal of Scientific and Technical Advancements, Volume 1, Issue 3, pp. 87-89, ISSN: 2454-1532.
• Fan, W., Fox, E., Pathak, P., Wu, H. (2004). The effects of fitness functions on genetic programming‐based ranking discovery for Web search, Journal of the Association for Information Science and Technology, https://doi.org/10. 1002/asi.20009.
• Varnamkhasti, J., Lee, L. (2012). A Fuzzy Genetic Algorithm Based on Binary Encoding for Solving Multidimensional Knapsack Problems, Journal of Applied Mathematics Volume 2012, Article ID 703601, http://dx.doi.org/10.1155 /2012/703601.
• Wetterstrand, K. (2023). Crossing Over, National Human Genome Research Institute, https://www.genome.gov/genetics-glossary/Crossing-Over, accessed on 2023-02-13.
• Dutta, A. (2019). Crossover in Genetic Algorithm, https://www.geeksforgeeks.org/ crossover-in-genetic-algorithm/, accessed on 2023-03-02.
• Hassanat, A., Almohammadi, K., Alkafaween, E., Abunawas, E., Hammouri, A., Prasath, V. (2019). Choosing Mutation and Crossover Ratios for Genetic Algorithms—A Review with a New Dynamic Approach. Information, 10(12), 390. MDPI AG. Retrieved from http://dx.doi.org/ 10.3390/ info10120390, accessed on 2023-03-18.
• Mallawaarachchi, V. (2017). Introduction to Genetic Algorithms, https://towardsdatascience.com/introduction-to-genetic-algorithms-including-example-code-e396e98d8bf3, accessed on 2023-02-15.
• Gad, A. (2018). Introduction to Optimization with Genetic Algorithm https:// towardsdatascience.com/introduction-to-optimization-with-genetic-algorithm-2f5001d9964b, accessed on 2023-01-11.
• Mishra, S., Sahoo S., Das, M. (2017). Genetic Algorithm: An Efficient Tool for Global Optimization, Advances in Computational Sciences and Technology, ISSN 0973-6107 Volume 10, Number 8 (2017) pp. 2201-2211.
• Clegg, J., Dawson, J., Porter, S., Barley, M. (2005). The use of a genetic algorithm to optimize the functional form of a multi- dimensional polynomial fit to experimental data. In: IEEE Congress on Evolutionary Computation, Edinburgh. IEEE Congress on Evolutionary Computation, 02-05 Sep 2005 IEEE , Edinburgh , pp. 928-934.