Analysis of оptimization methods for solving the problem of developing rational variants for equipping the Armed Forces with aircraft
DOI:
https://doi.org/10.54858/dndia.2025-21-3Keywords:
combat potential, armed forces aviation, aircraft, airworthiness maintenance, modernization, procurement, optimization, algorithmAbstract
The article is dedicated to solving the topical scientific-practical problem of forming rational variants for the technical equipping (rearmament) of the armed forces with aircraft by optimizing the set of programmatic measures for maintaining their serviceability, modernization, and procurement. This problem is formalized as an integer linear programming problem of the “knapsack type” (“optimal loading”). A systemic analysis of optimization methods suitable for solving this problem of developing rational variants for equipping the armed forces with aircraft has been conducted. The objective function is defined as the maximization of the aviation’s combat potential, subject to a number of constraints, primarily on financial expenditure. A comparative analysis of exact (brute force, branch and bound, dynamic programming) and heuristic (greedy, genetic) algorithms for solving the posed problem is conducted. Their advantages, disadvantages, computational complexity (performance), accuracy, and limitations on the number of variables are analyzed. The results of the analysis are systematized in the form of a comparative table with corresponding conclusions
References
Демидов Б.О., Луханін М.І., Величко А.Ф., Науменко М.В. Системна методологія планування розвитку, передпроєктних досліджень та зовнішнього проєктування озброєння і військової техніки: Монографія. Київ : ВБ “Стілос”, 2011. – 464 с.
Kleinberg J., Tardos É. Algorithm Design (Pearson/Addison-Wesley, 2005). – 864 р.
Кормен Т., Лейзерсон Ч., Рівест Р., Стайн К. Вступ до алгоритмів. 3-тє вид. / пер. з англ. Київ : К.І.С., 2019. –
с.
Arora S., Barak B. Computational Complexity: A Modern Approach. Cambridge University Press, 2009. – 596 p.
Wolsey L. A. Integer Programming. New York : John Wiley & Sons, 1998. –304 p.
Papadimitriou C. H., Steiglitz K. Combinatorial Optimization: Algorithms and Complexity. Mineola, New York: Dover Publications, 1998. – 512 p.
Mitchell M. An Introduction to Genetic Algorithms. Cambridge, MA : MIT Press, 1998. – 224 p.
Seif G. Introduction to Genetic Algorithms – Including Example Code. Towards Data Science. 2018, URL: https://towardsdatascience.com/genetic-algorithm-6aefd897f1ac/ (дата звернення: 16.10.2025).
