GROWING TREE METHOD FOR OPTIMISATION OF MULTIFACTORIAL EXPERIMENTS
DOI:
https://doi.org/10.15588/1607-3274-2023-3-6Keywords:
growing tree method, algorithm, multifactorial experiment, software, comparisonAbstract
Context. The task of planning multifactorial experiments is important in science and industrial production. In the context of competition, rising costs, and increasing efficiency, it is necessary to optimize plans for multifactorial experiments in terms of cost and time. To solve this problem, there are a number of approaches and methods, the choice of which for a competitive technical task is an important and difficult task. In this regard, there is a need to develop new methods for optimizing the cost (time) of multifactorial experiment plans, compare them with existing methods, and give recommendations for practical application in the study of real objects.
Objective. The purpose of the study is to develop and test the method of growing trees, to evaluate its effectiveness in comparison with other methods. The following tasks has been solved to achieve this goal: the proposed method of growing trees has been implemented in the form of software; the method has been used to optimize plans for multifactorial experiments in the study of real objects; its effectiveness has been evaluated in comparison with other methods; recommendations for its use were given.
Method. The proposed method of growing trees is based on the application of graph theory. The advantage of the method is the reduction of time for solving optimization problems related to the construction of optimal plans for multifactorial experiments in terms of cost (time) expenses. Another characteristic feature is the high accuracy of solving optimization problems.
Results. The results of experiments and comparisons with other optimization methods confirm the efficiency and effectiveness of the proposed method and allow us to recommend it for the study of objects with the number of significant factors k ≤ 7. It is promising to further expand the range of scientific and industrial objects for their study using this method.
Conclusions. A growing tree method has been developed for the optimization of multifactorial experimental plans in terms of cost and time expenditures, along with software that implements it using the Angular framework and the TypeScript programming language.
The effectiveness of the growing tree method is shown in comparison with the following methods: complete and limited enumeration, monkey search, modified Gray code application, and bacterial optimization. The growing tree method is faster than complete enumeration and can be applied to optimize multifactorial experimental plans in terms of cost (time) expenses for objects with a number of factors k ≤ 7. In solving optimization problems, the method of growing trees gives better results compared to monkey search, limited enumeration and bacterial optimization.
References
Yazdani M., Jolai F. Lion optimization algorithm (loa): a nature-inspired metaheuristic algorithm, Journal of computational design and engineering, 2016, Vol. 3, №1, pp. 24–36. DOI: 10.1016/j.jcde.2015.06.003.
Hatamlou A. Black hole: A new heuristic optimization approach for data clustering, Information sciences, 2013, Vol. 222, pp. 175–184. DOI: 10.1016/j.ins.2012.08.023.
Mirjalili S., Mirjalili S. M., Lewis A. Grey wolf optimizer, Advances in engineering software, 2014, Vol. 69, pp. 46–61. DOI: 10.1016/j.advengsoft.2013.12.007.
Uymaz S. A., Tezel G., Yel E. Artificial algae algorithm (aaa) for nonlinear global optimization, Applied Soft Computing, 2015, Vol. 31, pp. 153–171. DOI: 10.1016/j.asoc.2015.03.003.
Gandomi A. H., Yang X. S., Talatahari S., Alav A. H. Firefly algorithm with chaos, Communications in Nonlinear Science and Numerical Simulation, 2013, Vol. 18, No. 1, pp. 89–98. DOI: 10.5815/ijitcs.2014.06.03.
Oftadeh R., Mahjoob M. A new meta-heuristic optimization algorithm: Hunting search, Soft Computing. Computing with Words and Perceptions in System Analysis. Decision and Control: ICSCCW 2009: Fifth International Conference on. IEEE, 2009, pp. 1–5. DOI: 10.1109/ICSCCW.2009.5379451
Sadollah A., Eskandar H., Bahreininejad A., Kim J. H. Water cycle algorithm with evaporation rate for solving constrained and unconstrained optimization problems, Applied Soft Computing, 2015, Vol. 30, pp. 58–71. DOI: 10.1016/j.asoc.2015.01.050.
Yang X. S. A new metaheuristic bat-inspired algorithm, Nature inspired cooperative strategies for optimization, 2010, pp. 65–74. DOI: 10.1007/978-3-642-12538-6_6.
Mafarja M. M., Eleyan D., Jaber I. et al. Binary dragonfly algorithm for feature selection, International Conference on New Trends in Computing Sciences (ICTCS): 11–13 October 2017: proceedings. Amman, IEEE, 2017, pp. 12– 17. DOI: 10.1109/ICTCS.2017.43.
Arora S., Anand P. Binary butterfly optimization approaches for feature selection, Expert Systems with Applications, 2019, Vol. 116, pp. 147–160. DOI: 10.1016/j.eswa.2018.08.051.
Chu S. C., Tsai P. W., Pan J. S. Cat swarm optimization, Pacific Rim International Conference on Artificial Intelligence, 7–11 August 2006, proceedings. Guilin, China, 2006, pp. 854–858. DOI:10.1007/11801603_94.
Yang X. S., Deb S. Cuckoo search via Lévy flights / X. S. Yang. // World congress on nature & biologically inspired computing. NaBIC, 2009, pp. 210–214. DOI: 10.1109/NABIC.2009.5393690.
Kaveh A. A new optimization method: Dolphin echolocation / A. Kaveh. N. Farhoudi // Advances in Engineering Software. – 2013. – Vol. 59. – P. 53-70. DOI: 10.1016/j.advengsoft.2013.03.004.
Yang X. S. Flower pollination algorithm for global optimization, International Conference on Unconventional Computing and Natural Computation, 3–7 September 2012, proceedings. Orléans, pp. 240–249. DOI: 10.1007/978-3642-32894-7_27.
Chang H. S. Converging Marriage in Honey-Bees Optimization and Application to Stochastic Dynamic Programming, Journal of Global Optimization, 2006, № 35, pp. 423–441. DOI: 10.1007/s10898-005-5608-4.
Pan J. S., Tsai P. W., Liao Y. B. Fish migration optimization based on the fishy biology, 2010 Fourth International Conference on Genetic and Evolutionary Computing, 13–15 December 2010, proceedings. Washington, IEEE, 2010, pp. 783–786. DOI: 10.1109/ICGEC.2010.198.
De Castro L. N., Von Zuben F. J. Learning and optimization using the clonal selection principle, IEEE Transactions Evolutionary Computation, 2002, Vol. 6, № 3, pp. 239–251. DOI: 10.1109/TEVC.2002.1011539.
Yang Q., Chu S. C., Liang A. et al. Tumbleweed Algorithm and Its Application for Solving Location Problem of Logistics Distribution Center, International Conference on Genetic and Evolutionary Computing, 10–14 July 2021, proceedings, 2021, pp. 641–652. DOI: 10.1007/978-981-168430-2_58.
Mirjalili S. The ant lion optimizer, Advances in Engineering Software, 2015, Vol. 83, pp. 90–98. DOI: 10.1016/j.advengsoft.2015.01.010.
Koshovyj M. D., Burljejev O. L., Pampuha A. I. Analiz metodiv optymal’nogo planuvannja bagatofaktornogo eksperymentu za vartisnymy ta chasovymy pokaznykamy, Zbirnyk naukovyh prac’ Vijs’kovogo instytutu Kyi’vs’kogo nacional’nogo universytetu imeni Tarasa Shevchenka, 2022, №75, pp. 94-107. DOI: 10.17721/2519-481X/2022/75-10.
Koshevoj N. D., Kostenko E. M., Pavlik A. V. i dr. Metodologija optimal’nogo po stoimostnym i vremennym zatratam planirovanija jeksperimenta: monografija. Poltava, Poltavskaja gosudarstvennaja agrarnaja akademija, 2017, 232 p.
Kennedy J., Eberhart R. Particle swarm optimization, International Conference on Neural Networks : 27 November – 01 December 1995 : proceedings. Perth, IEEE, 2002, Vol. 4, pp. 1942–1948. DOI: 10.1109/ICNN.1995.488968.
Koshevoy N. D., Kostenko E. M., Beliaieva A. A. Comparative analysis of optimization methods in the investigation of weigh-measuring system and thermoregulator, Radio Electronics. Computer Science, Control, 2018, № 4, pp. 179–187. DOI: 10.15588/16073274-2018-4-17.
Holland J., Goldberg D. Genetic algorithms in search. optimization and machine learning. Massachusetts, Addison-Wesley, 1989, P. 414.
Koshevoy N. D., Muratov V. V., Kirichenko A. L. et al. Application of the “Jumping frogs” algorithm for research and optimization of the technological process, Radio Electronics. Computer Science, Control, 2021, №1, pp. 57– 65. DOI: https://doi.org/10.15588/1607-3274-2021-1-6.
[Koshevoy N. D., Dergachov V. A., Pavlyk A. V. et al. The method of building plans of multifactorial experiments with minimal number of factor levels measurements and optimal by cost(time) expenses, Radio Electronics. Computer Science, Control, 2020, №4, pp. 55–64. DOI: 10.15588/1607-3274-2020-4-6.
Koshevoy N. D., Kostenko E. M., Muratov V. V. et al. Comparative analysis of optimization methods by cost (time) costs of full factor experiment plans, 2020, № 1, pp. 54–62. DOI: 10.15588/1607-3274-2020-1-6.
Koshevoy N. D., Kostenko E. M., Muratov V. V. Application of the fish search method for optimization plans of the full factor experiment, Radio Electronics. Computer Science, Control, 2020, № 2, pp. 44–50. DOI: 10.15588/1607-3274-2020-2-5.
Rutenbar R. A. Simulated annealing algorithms: An overview, IEEE Circuits and Devices Magazine, 1989, № 5, pp. 19–26. DOI: 10.1109/101.17235.
Harari F. Teorija grafov. Moscow, Mir, 1973, pp. 48-59.
Vvedenie v typescript [Jelektronnyj resurs], 2021. URL: https://metanit.com/web/typescript.
Muratov V. V. Udoskonalennja doslidzhennja tehnologichnyh procesiv. prystroi’v i system na osnovi planuvannja eksperymentu : dys. … doktor filosofii’ : 11.21.21. Kharkiv, Nacional’nyj aerokosmichnyj universytet im. M. Je. Zhukovs’kogo “Kharkivs’kyj aviacijnyj instytut”, 2021, 230 p.
Koshova I. I. Metody ta zasoby optymal’nogo planuvannja eksperymentiv dlja doslidzhennja tehnologichnyh procesiv. prystroi’v i system : dys. … doktor filosofii’ : 03.12.20. Kharkiv, Nacional’nyj aerokosmichnyj universytet im. M. Je. Zhukovs’kogo “Kharkivs’kyj aviacijnyj instytut”, 2020, 209 p.
Zabolotnyi O., Koshevoy N. An effective method of bulk materials moisture measurement using capacitive sensors, Journal of Stored Products Research, 2020, Vol. 89. doi.org/10.1016/j.jspr.2020.101733.
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2023 М. Д. Кошовий, О. Т. Пилипенко, І. В. Ільїна, В. В. Токарєв
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.
Creative Commons Licensing Notifications in the Copyright Notices
The journal allows the authors to hold the copyright without restrictions and to retain publishing rights without restrictions.
The journal allows readers to read, download, copy, distribute, print, search, or link to the full texts of its articles.
The journal allows to reuse and remixing of its content, in accordance with a Creative Commons license СС BY -SA.
Authors who publish with this journal agree to the following terms:
-
Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License CC BY-SA that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
-
Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
-
Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work.
