Using genetic algorithms to solve the problem of finding the optimal composition of the reaction mixture

A heuristic approach to optimization of complex physicochemical processes in the form of a genetic algorithm for solving problems is presented. In comparison with other evolutionary methods, the genetic algorithm allows working with large search spaces and complex evaluation functions, which is especially important in the study of multifactor physicochemical systems. Due to the relatively high need for computing resources when working with large and complex search spaces, optimization of existing calculation organization schemes has a positive effect on the accuracy of the calculated results. The paper presents a modified genetic algorithm that minimizes the number of iterations to achieve a given accuracy when solving the problem of finding the optimal composition of the initial reaction mixture. For a complex physicochemical process, an optimization problem is formulated which consists in finding the composition of the initial reaction mixture that promotes maximization (or minimization) of a given target parameter. The optimality criterion is determined by the type of the problem being solved and, when organizing calculations, is focused on the maximum yield of the target product. The main steps of implementing the genetic algorithm include creating an initial set of solutions and subsequent iterative evaluation of their quality for subsequent combination and modification until optimal values are achieved using mechanisms similar to biological evolution. To improve the efficiency of the method and reduce the number of iterations, a modification of the genetic algorithm is proposed which boils down to a dynamic estimate of the “mutation” parameter, depending on the diversity of individuals in the formed population of solutions. In a series of computational experiments, an analysis was made of the influence of the genetic algorithm parameters on the accuracy and efficiency of solving the problem using the example of studying the kinetics of the Michaelis-Menten enzymatic reaction. The results of calculations to determine the optimal composition of the reaction mixture showed that the dynamic determination of the “mutation” parameter contributes to an increase in the accuracy of the problem solution and a multiple decrease in the relative error value reaching 0.77 % when performing 200 iterations and 0.21 % when performing 400 iterations. The presented modified approach to solving the optimization problem is not limited by the type and content of the studied physicochemical process. The calculations performed showed a high degree of influence of the “mutation” parameter on the accuracy and efficiency of the problem solution, and dynamic control of the value of this parameter allowed increasing the speed of the genetic algorithm and reduce the number of iterations to achieve an optimal solution of a given accuracy. This is especially relevant in the study of multifactorial systems when the influence of parameters is non-trivial.

1. Panteleev A.V. Metaheuristic Algorithms for Finding the Global Extremum. Moscow, MAI-PRINT Publ., 2009, 160 p. (in Russian)

2. Panteleev A., Skavinskaya D.V., Aleshina E. Metaheuristic Algorithms of Search of Optimum Program Control. Moscow, Infra-M Publ., 2020, 396 p. (in Russian). https://doi.org/10.1273718293

3. Karpenko A.P. Modern Search Engine Optimization Algorithms. Algorithms Inspired by Nature. Moscow, Bauman Moscow State Technical University Publ., 2014, 448 p. (in Russian)

4. Simon D. Evolutionary Optimization Algorithms. Wiley, 2013, 784 p.

5. Holland J.H. Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence. University of Michigan Press, 1992, 211 p.

6. Goldberg D.E. Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley, 1989, 412 p.

7. Long Q., Wu Ch., Huang T., Wang X. A genetic algorithm for unconstrained multi-objective optimization. Swarm and Evolutionary Computation, 2015, vol. 22, pp. 1–14. https://doi.org/10.1016/j.swevo.2015.01.002

8. Mohamed A.W., Mohamed A.K. Adaptive guided differential evolution algorithm with novel mutation for numerical optimization. International Journal of Machine Learning and Cybernetics, 2019, vol. 10, no. 2, pp. 253–277. https://doi.org/10.1007/s13042-017-0711-7

9. Andraws S., Shmatkov S., Bulavin D. Using genetic algorithms for solving the comparison-based identification problem of multifactor estimation model. Journal of Software Engineering and Applications, 2013, vol. 6, no. 7, pp. 349–353. https://doi.org/10.4236/jsea.2013.67044

10. Gholizadeh S., Salajegheh E., Torkzadeh P. Structural optimization with frequency constraints by genetic algorithm using wavelet radial basis function neural network. Journal of Sound and Vibration, 2008, vol. 312, no. 1-2, pp. 316–331. https://doi.org/10.1016/j.jsv.2007.10.050

11. Salajegheh E., Gholizadeh S. Optimum design of structures by an improved genetic algorithm using neural networks. Advances in Engineering Software, 2005, vol. 36, no. 11-12, pp. 757–767. https://doi.org/10.1016/j.advengsoft.2005.03.022

12. Ono I., Kita H., Kobayashi S. A real-coded genetic algorithm using the unimodal normal distribution crossover. Advances in Evolutionary Computing. Springer, 2003, pp. 213–237. https://doi.org/10.1007/978-3-642-18965-4_8

13. Tsutsui S., Yamamura M., Higuchi T. Multi-parent recombination with simplex crossover in real coded genetic algorithms. Proc. of the 1st Annual Conference Genetic and Evolutionary Computation (GECCO’99). V. 1, 1999, pp. 657–664.

14. Rolland L., Chandra R. The forward kinematics of the 6-6 parallel manipulator using an evolutionary algorithm based on generalized generation gap with parent-centric crossover. Robotica, 2016, vol. 34, no. 1, pp. 1–22. https://doi.org/10.1017/s0263574714001362

15. Elfeky Eh.Z., Sarker R.A., Essam D.L. Analyzing the simple ranking and selection process for constrained evolutionary optimization. Journal of Computer Science and Technology, 2008, vol. 23, no. 1, pp. 19–34. https://doi.org/10.1007/s11390-008-9109-z

16. Antipina E.V., Mustafina S.A., Antipin A.F. Search for the optimal initial concentrations of catalytic reaction compounds on the basis of a kinetic model. Optoelectronics, Instrumentation and Data Processing, 2023, vol. 59, no. 4, pp. 461–469. https://doi.org/10.3103/S8756699023040027

17. Thakur M., Meghwani S.S., Jalota H. A modified real coded genetic algorithm for constrained optimization. Applied Mathematics and Computation, 2014, vol. 235, pp. 292–317. https://doi.org/10.1016/j.amc.2014.02.093

18. Hangos K.M., Szederkényi G. Mass action realizations of reaction kinetic system models on various time scales. Journal of Physics: Conference Series, 2011, vol. 268, pp. 012009. https://doi.org/10.1088/1742-6596/268/1/012009

19. Antipina E.V., Mustafina S.A., Antipin A.F. Numerical algorithm for finding the optimal composition of the reacting mixture on the basis of the reaction kinetic model. Scientific and Technical Journal of Information Technologies, Mechanics and Optics, 2023, vol. 23, no. 6, pp. 1128–1135. (in Russian). https://doi.org/10.17586/2226-1494-2023-23-6-1128-1135