SHORTEST PATH OPTIMISATION FOR MILITARY OPERATIONS WITH MS EXCEL AND WOLFRAM MATHEMATICA
DOI:
https://doi.org/10.31110/fmo2025.v40i2-08Keywords:
military logistics, teaching optimization problems, shortest path problem, MS Excel, Solver, Wolfram MathematicaAbstract
In the context of contemporary military operations, optimizing the routes of military units is of paramount importance. The selection of appropriate routes is pivotal in determining the efficiency of combat missions, the safety of personnel, and the efficacy of logistics processes. The identification of the most efficient route is a critical consideration in military operations, cargo transportation, and rescue missions.
Formulation of the problem. The rapid development of computer modelling in various fields has created the possibility of designing complex systems, analyzing their properties, and managing them effectively in conditions of limited time, resources, and incomplete information. To study the characteristics of such systems and solve key management problems, it is necessary to be able to build their mathematical models.
Materials and methods. In order to make informed decisions and improve the efficiency of combat and logistics tasks, it is essential for future military specialists to master the construction of mathematical models. Mathematical modelling methods, in particular shortest path search algorithms, can be used to solve such problems. The simplest systems for implementing these methods are MS Excel and Wolfram Mathematica, which have powerful tools for route analysis and optimization.
Results. The proposed approaches have been tested in the educational process of training cadets at the Kharkiv National Air Force University named after I. Kozhedub. They allow students to learn the basics of graph theory, optimization methods, and military logistics principles. The use of Wolfram Mathematica has demonstrated significant advantages in terms of speed and accuracy of calculations compared to Excel, especially in cases of dynamic route changes.
Conclusions. The teaching methods for finding the shortest route using MS Excel and Wolfram Mathematica will help cadets develop analytical thinking skills, understand the importance of algorithmic approaches to military planning. This is especially important for future military analysts, engineers, logistics, and information technology specialists.
Downloads
References
Babych, V., Kostenko, A., Plesha, V., Plesha, M., & Khmiliarchuk, L. (2023). Zadacha poshuku naikorotshoho shliakhu: porivnialnyi analiz osnovnykh alhorytmiv. Information Technology: Computer Science, Software Engineering and Cyber Security, 2, 99-106. https://doi.org/10.32782/IT/2023-2-12 (in Ukrainian).
Nikolskyi, Yu. V., Pasichnyk, V. V., & Shcherbyna, Yu. M. (2007). Dyskretna matematyka. K.: Vydavnycha hrupa BHV. (in Ukrainian).
Trofymenko, O. H., Sokolov, A. V., Loginova, N. I., Akhmametiieva, H. V., & Chikunov, P. O. (2024). Artificial Intelligence in Military Logistics. System Technologies, 5(154), 164-171. https://doi.org/10.34185/1562-9945-5-154-2024-17.
Bellman, R. (1958). On a routing problem. Quarterly of Applied Mathematics, 16(1), 87-90.
Benhassine, M., Quinn, J., Stewart, D., Arsov, A. A., Ianc, D., Ivan, M., & Van Utterbeeck, F. (2024). Advancing military medical planning in large scale combat operations: Insights from computer simulation and experimentation in NATO's vigorous warrior exercise 2024. Military Medicine, 189, 456-464. https://doi.org/10.1093/milmed/usae152.
Cao, L., Zhao, X., Zheng, H., & Zhao, B. (2011). Approximating shortest path in social graph. UC Santa Barbara: Computer Science Department.
Chen, K., Makki, K., & Pissinou, N. (2009). A real-time wireless route guidance system for urban traffic management and its performance evaluation. In 2009 IEEE 70th Vehicular Technology Conference Fall (pp. 1-5). http://dx.doi.org/10.1109/VETECF.2009.5378786
Díaz-Madroñero, M., Peidro, D., & Mula, J. (2015). A review of tactical optimization models for integrated production and transport routing planning decisions. Computers and Industrial Engineering, 88, 518 - 535. https://doi.org/10.1016/j.cie.2015.06.010.
Dijkstra, E.W. (1959). A note on two problems in connexion with graphs. Numerische Mathematik, 1, 269-271.
Ford, L. R., Jr., & Fulkerson, D. R. (1962). Flows in networks. Princeton University Press.
Ham, A. (2020). Drone-based material transfer system in a robotic mobile fulfillment center. IEEE Transactions on Automation Science and Engineering, 17(2), 957-965. https://doi.org/10.1109/TASE.2019.2952523.
Kanza, Y., Levin, R., Sagiv, Y., & Safra, E. (2010). Interactive route search in the presence of order constraints. Proceedings of the VLDB Endowment, 3(1), 117-128. https://doi.org/10.14778/1920841.1920861.
Levin, R., & Kanza, Y. (2014). TARS: Traffic-aware route search. GeoInformatica, 18(3), 461-500. https://doi.org/10.1007/s10707-013-0185-z.
Loucks, D.P. (2022). Solving Models Using Excel. International Series in Operations Research and Management Science (Vol. 318, pp. 65-74). https://doi.org/10.1007/978-3-030-93986-1_6.
Sharifzadeh, M., Kolahdouzan, M., Shahabi, C. (2008). The optimal sequenced route query. VLDB Journal, 17(4), 765-787. https://doi.org/10.1007/s00778-006-0038-6.
Shi, H., Cao, W., Zhu, S., & Zhu, B. (2009). Applications of the improved A* algorithm for route planning. In 2009 2nd International Conference on Intelligent Computing Technology and Automation, 1, 299-302). http://dx.doi.org/10.1109/ICICTA.2009.79.
Wolfram, S. (2003). The Mathematica book (5th ed.). Champaign: Wolfram Media.
Zhang, L., Wang, N., & Zhang, C. (2022). Research on optimization of logistics supply path selection based on genetic algorithm. Highlights in Science, Engineering and Technology, 1, 188-192. https://doi.org/10.54097/hset.v1i.460.
Downloads
Published
Issue
Section
Categories
How to Cite
License
Copyright (c) 2025 Ольга Удодова, Сніжана Вовчук
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
- Authors grant the journal a right of the first publication of the work under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License (CC BY-NC-SA 4.0)that allows others freely to use (read, copy and print) submissions, search content and link to published articles, disseminate their full text and use them for any legitimate non-commercial purposes (i.e. educational or scientific) with the mandatory reference to the article’s authors and initial publication in this journal.
- Original published articles cannot be used by users (exept authors) for commercial purposes or distributed by third-party intermediary organizations for a fee.
