Implementation of the gravity search method for optimization by cost expenses of plans for multifactorial experiments

Nikolay Koshevoy, Iryna Ilina, Volodymyr Tokariev, Anna Malkova, Victor Muratov

Abstract


One of the main ways to improve the efficiency of experimental research is the use of methods for planning experiments. At the same time, experiment planning can significantly reduce the amount of experimental research by reducing the number of experiments, as well as improve the accuracy and reliability of the results obtained. It is characteristic that the experiments in terms of experiment are not equivalent, that is, their implementation requires different material and time costs. In this regard, the problem arises of optimizing the plans of multivariate experiments in terms of cost or time costs. This is especially important when studying valuable and long-term processes. To solve the problems of optimizing plans for multifactorial experiments in terms of cost (time) costs, it is necessary to develop effective methods for finding optimal plans and their software. Existing methods for optimizing experimental plans are characterized by such shortcomings as low speed, a limited number of studied object factors, and the exact solution is not always found. This article explores the method of gravitational search for the optimal cost (time) cost plan for multifactorial experiments. The method uses the analogy of the motion of solid bodies due to their gravitational interaction. In this case, the rows of the experiment planning matrix are considered as such solid bodies, which are placed in it depending on the decrease in the cost of transitions between rows (gravity). An algorithm and software have been developed that implement the proposed method. The program is presented in the algorithmic language Python. On a number of examples for the study of technological processes, the efficiency and effectiveness of the method of gravitational search for optimal cost (time) costs of plans for multifactor experiments has been proved. The object of the research: processes of optimization of plans of multifactorial experiments according to cost (time) costs. The subject of the study: the method of gravitational search for the optimal cost (time) plans of multifactorial experiments and the software implementing it.

Keywords


experiment plan; gravity search; optimization; cost; time; software

Full Text:

PDF

References


Krivoulya, G., Ilina, I., Tokariev, V., Shcherbak, V. Mathematical Model for Finding Probability of Detecting Victims of Man-Made Disasters Using Distributed Computer System with Reconfigurable Structure and Programmable Logic. IEEE International Scientific-Practical Conference Problems of Infocommunications, Science and Technology (PIC S&T), 6-9 October 2020, Kharkiv, pp. 573-576. DOI: 10.1109/PICST51311.2020.9467976.

Ruban, I., Ilina, I., Mozhaiev, M. Researching priority directions in the area of Data. Control navigation and communication systems, 2020, vol. 4, no. 62, pp. 59-63. DOI: 10.26906/SUNZ.2020.4.059.

Neittaanmäki, P., Repin, S., Tuovinen, T. Mathematical Modeling and Optimization of Complex Structures, Springer Publ., 2016. 349 p. DOI: 10.1007/978-3-319-23564-6.

Hoskins, D. S. Combinatorics and statistical inferecing. Applied Optimal Designs, 2007, no. 4, pp. 147-179.

Bailey, R. A. Cameron, P. G. Combinatorics of optimal designs. Surveys in Combinatorics, 2009, vol. 365, pp. 19-73.

Karpenko, A. P. Sovremennye algoritmy poiskovoj optimizacii. Algoritmy, vdohnovlennye prirodoj [Modern search engine optimization algorithms. Algorithms inspired by nature]. Moscow, Bauman MSTU Publ., 2017. 446 p.

Kostenko, O. M. Metodologiya optymal`nogo planuvannya eksperymentiv pry doslidzhenni texnologichnyx procesiv, prystroyiv i system [Methodology of optimal planning of experiments in the study of technological processes, devices and systems]. Zbirnyk naukovyx pracz Poltavs`kogo nacionalnogo texnichnogo universy`tetu im. Yu. Kondratyuka. Seriya, Galuzeve mashy`nobuduvannya, 2011, no. 1, pp. 57-60.

Kostenko, O. M. Optymizaciya planiv eksperymentiv v umovax obmezhenyx material`nyx ta chasovyx resursiv [Optimization of experimental plans in conditions of limited material and time resources]. Visnyk Poltavs`koyi derzhavnoyi agrarnoyi akademiyi, 2005, no. 3, pp. 124-131.

Koshevoy, N. D., Kostenko, E. M., Gordienko, V. A., Syroklyn, V. P. Optimum planning of experiment in manufacturing the electronic equipment. Telecommunications and Radio Engineering, 2011, vol. 70, no. 8, pp. 731-734. DOI: 10.1615/TelecomRadEng.v70.i8.60..

Bona, M. Combinatorics of permutations. N.Y., CRC Press Publ., 2012. 478 p.

Koshevoy, N.D., Dergachov, V.A., Pavlik, A.V., Siroklyn, V.P., Koshevaya, I.I., Hrytsai, O.A. Modified Gray Codes for the Value (Time) Optimization of a Multifactorial Experiment Plans. Lecture Notes in Networks and Systems, 2020, vol. 367, pp. 331-343.DOI: 10.1007/978-3-030-94259-5_29.

Kurennov, S., Barachov K., Taranenko, I., Stepanenko, V. A genetic algorithm of optimal design of beam at restricted sagging. Radioelectronic and Computer Systems, 2022, no. 1(10), pp. 83-91. DOI: 10.32620/reks.2022.1.06.

Koshevoy, N. D., Gordienko, V. A., Sukhobrus, Ye. A. Optimization for the design matrix realization value with the aim to investigate technological processes. Telecommunications and Radio Engineering, 2014, vol. 73, no. 15, pp. 1383-1386.DOI: 10.1615/TelecomRadEng.V73.i15.60.

Katoch, S., Chauhan, S.S., Kumar, V. A review on genetic algorithm: past present and future. Multimedia Tools and Applications, 2021, vol. 80, iss. 5, pp. 8091-8126. DOI: 10.1007/s11042-020-10139-6.

Alam, T. Qamar, Sh., Dixit, A., Benaida, M. Genetic Algorithm: Reviews, Implementations, and Applications. International Journal of Engineering Pedagogy, 2020, vol. 10, no. 3, pp. 57-77. DOI: 10.48550/arXiv.2007.12673.

Djurdjev, M., Cep, R., Lukic, D., Antic, A., Popovic, B., Milosevic, M. A genetic crow search algorithm for optimization of operation sequencing in process planning. Applied Sciences, 2021, vol. 11, iss. 5, article no. 1981. DOI: 10.3390/app11051981.

Petrovic, M., Mitic, M., Vukovic, N., Miljkovic, Z. Chaotic particle swarm optimization algorithm for flexible process planning. The International Journal of Advanced Manufacturing Technology, 2016, no. 85. pp. 2535–2555. DOI: 10.1007/s00170-015-7991-4.

Gad, A. G. Particle Swarm Optimization Algorithm and Its Applications: A Systematic Review. Archives of Computational Methods in Engineering, 2022, vol. 29, pp. 2531–2561. DOI: 10.1007/s11831-021-09694-4.

Kallab, Ch., Haddad, S., El-Zakhem, I., Sayah, J., Chakroun, M., Turkey, N., Charafeddine, J., Hamdan, H., Shakir, W. Generic Tabu search. Journal of Software Engineering and Applications, 2022, vol. 15, no 7, pp. 262-273. DOI: 10.4236/jsea.2022.157016.

Glover, F., Laguna, M., Marti, R. Principles and Strategies of Tabu Search. Handbook of Approximation Algorithms and Metaheuristics. Chapter 21, Second Edition, Chapman and Hall/CRC, 2018. 17 p. DOI: 10.1201/9781351236423.

Neskorodieva, T. Fedorov, Eu., Chuchuzhko, M., Chuchuzhko, V. Metaheuristic method for searching qusi-optimal route based on the ant algorithm and annealing simulation. Radioelectronic and Computer Systems, 2022, no. 1(10), pp. 92-102. DOI: 10.32620/reks.2022.1.07.

Deng, W., Xu, J., Zhao, H. An improved ant colony optimization algorithm based on hybrid strategies for scheduling problem. IEEE Access, 2019, vol. 7, pp. 20281-20292. DOI: 10.1109/ACCESS.2019.2897580.

Zlatkin, A. A., Marusyk, O. S. Analiz algorytmu murashynyx kolonij ta jogo modyfikacij na prykladi vyrishennya zadachi komivoyazhera [Analysis of the algorithm of ant colonies and its modifications on the example of solving the problem of a salesman]. Visnyk Cherkaskogo derzhavnogo texnologichnogo universytetu. Seriya, Texnichni nauky, 2017, no. 4, pp. 21-26.

Zhan, Sh., Lin, J., Zhang, Z., Zhong, Y. List-Based Simulated Annealing Algorithm for Traveling Salesman Problem. Computational Intelligence and Neuroscience, 2016, vol. 2016, Article ID: 1712630. 12 p. DOI: 10.1155/2016/1712630.

Kozin, I. Maksushko, N., Tereshko, Ya. Metod imitaciyi vidpalu dlya zadachi rivnovazhnogo rozmishhennya [A annealing simulation method for the equilibrium placement problem]. Fizyko-matematychne modelyuvannya ta informacijni texnologiyi, 2021, vol. 32, pp. 152-158. DOI: 10.15407/fmmit2021.32.152.

Yang, J. Design on Generating Test Paper Based on Simulated Annealing Algorithm. 2nd International Conference on Civil, Materials and Environmental Sciences, 13-14 March, London, 2015, pp. 689-693. DOI: 10.2991/cmes-15.2015.186.

Wilkes, M. Advanced Python Development, Berkeley, CA. Apress Publ., 2020. 628 р.

De Almeida, Bruno Seixas Gomes., Leite Victor Coppo. Particle Swarm Optimization: A Powerful Technique for Solving Engineering Problems. In book: Swarm Intelligence - Recent Advances, New Perspectives and Applications. Chapter 3, 2019. 21 p. DOI: 10.5772/intechopen.89633.

Noma, M. A., Alatefi, M., Al-Ahmari, A. M., Ali, T. Tabu Search Algorithm Based on Lower Bound and Exact Algorithm Solutions for Minimizing the Makespan in Non-Identical Parallel Machines Scheduling. Mathematical Problems in Engineering, 2021, vol. 2021, Special Issue, Article ID: 1856734. 9 p. DOI: 10.1155/2021/1856734.

Koshevoy, N. D., Kostenko, E. M., Belyaeva, А. А. Sravnitel'nyy analiz metodov optimizatsii pri issledovanii vesoizmeritel'noy sistemy i termoregulyatora [Comparative analysis of optimization methods in the investigation of a weighmeasuring system and thermoregulator]. Radio Electronics, Computer Science, Control, 2018, no. 4, pp. 179-187.




DOI: https://doi.org/10.32620/reks.2023.1.02

Refbacks

  • There are currently no refbacks.