Network War Strategy Optimization: A Military-Strategy-Inspired Metaheuristic with Reconnaissance, Tactical Engagement, and Adaptive Retreat

Authors

  • Snigdharani Panda * Department of Computer Science and Engineering, GIFT Autonomous, Bhubaneswar, Odisha, India. https://orcid.org/0009-0009-7608-972X
  • Sunday Adesina Adebisi Department of Mathematics, Faculty of Science, University of Lagos, Lagos, Nigeria.

https://doi.org/10.48313/maa.vi.62

Abstract

This paper proposes Network War Strategy Optimization (NWSO), a novel nature-inspired metaheuristic algorithm for solving continuous Global Optimization (GO) problems. The algorithm is inspired by Military strategy: reconnaissance, strategic deployment, tactical engagement, retreat/regroup, and it incorporates reconnaissance-exploration, tactical-exploitation, adaptive retreat, multi-army competition as its core search mechanism. Unlike existing metaheuristics that rely on a single update rule applied uniformly across the population, NWSO introduces a set of named operators that collectively capture the multi-phase dynamics of its biological inspiration. Each operator is formalized as a mathematically defined update rule, and the interaction between operators is controlled by adaptive parameters that respond to the local geometry of the search landscape. The proposed algorithm is evaluated on the Congress on Evolutionary Computation (CEC) 2017 benchmark suite (29 test functions) and the CEC 2020 benchmark suite (10 test functions), and its performance is compared against 11 state-of-the-art metaheuristic algorithms: Particle Swarm Optimization (PSO), Genetic Algorithm (GA), Differential Evolution (DE), Grey Wolf Optimizer (GWO), Whale Optimization Algorithm (WOA), NSGA-II, MOEA/D, Ant Colony Optimization (ACO), Teaching-Learning-Based Optimization (TLBO), Gravitational Search Algorithm (GSA), Multi-Verse Optimizer (MVO). The experimental results demonstrate that NWSO achieves the best mean fitness on 24 out of 29 CEC 2017 functions and on 8 out of 10 CEC 2020 functions. The Friedman test ranks NWSO first with an average rank of 1.34, and the Wilcoxon rank-sum test confirms that the improvements are statistically significant at p < 0.05 on at least 22 of the 29 CEC 2017 functions. An ablation study quantifies the contribution of each operator to the algorithm's overall performance, with the most critical operator producing a degradation of up to 33.6% when removed. The algorithm is further validated on two classical engineering design problems (welded beam design and pressure vessel design), on which it obtains solutions competitive with the best known optima. A Sobol sensitivity analysis confirms that the algorithm's parameters are well-balanced, with no single parameter dominating the algorithm's behavior. A scalability analysis on problem dimensions D = 10, 50, 100, 500, and 1000 demonstrates near-linear scaling of wall-clock time with the problem dimension. The results collectively demonstrate that NWSO is a competitive metaheuristic for continuous GO, with broad applicability to engineering design, machine learning hyperparameter tuning, and scientific computing.

Keywords:

Metaheuristic optimization, Network war strategy optimization, Military strategy: reconnaissance, Strategic deployment, Engineering design

References

  1. [1] Liang, J. J., Qu, B. Y., & Suganthan, P. N. (2013). Problem definitions and evaluation criteria for the CEC 2014 special session and competition on single objective real-parameter numerical optimization. Computational intelligence laboratory, zhengzhou university, zhengzhou china and technical report, nanyang technological university, Singapore, 635(2), 2014. https://bee22.com/manual/tf_images/Liang CEC2014.pdf
  2. [2] Karaboga, D., & Basturk, B. (2007). A powerful and efficient algorithm for numerical function optimization: Artificial bee colony (ABC) algorithm. Journal of global optimization, 39(3), 459–471. https://doi.org/10.1007/s10898-007-9149-x
  3. [3] Passino, K. M. (2002). Biomimicry of bacterial foraging for distributed optimization and control. IEEE control systems magazine, 22(3), 52–67. https://doi.org/10.1109/MCS.2002.1004010
  4. [4] Mirjalili, S., Gandomi, A. H., Mirjalili, S. Z., Saremi, S., Faris, H., & Mirjalili, S. M. (2017). Salp swarm algorithm: A bio-inspired optimizer for engineering design problems. Advances in engineering software, 114, 163–191. https://doi.org/10.1016/j.advengsoft.2017.07.002
  5. [5] Mirjalili, S., & Lewis, A. (2016). The whale optimization algorithm. Advances in engineering software, 95, 51–67. https://doi.org/10.1016/j.advengsoft.2016.01.008
  6. [6] Dorigo, M., Maniezzo, V., & Colorni, A. (1996). Ant system: Optimization by a colony of cooperating agents. IEEE transactions on systems, man, and cybernetics, part b (cybernetics), 26(1), 29–41. https://doi.org/10.1109/3477.484436
  7. [7] Tanabe, R., & Fukunaga, A. (2013). Success-history based parameter adaptation for differential evolution. 2013 IEEE congress on evolutionary computation (pp. 71-78). IEEE. https://doi.org/10.1109/CEC.2013.6557555
  8. [8] Faramarzi, A., Heidarinejad, M., Stephens, B., & Mirjalili, S. (2020). Equilibrium optimizer: A novel optimization algorithm. Knowledge-based systems, 191, 105190. https://doi.org/10.1016/j.knosys.2019.105190
  9. [9] Alimoradi, M., Zabihimayvan, M., Daliri, A., Sledzik, R., & Sadeghi, R. (2022). Deep neural classification of darknet traffic. In Artificial intelligence research and development (pp. 105-114). IOS Press. https://doi.org/10.3233/FAIA220323
  10. [10] Hansen, N., & Ostermeier, A. (2001). Completely derandomized self-adaptation in evolution strategies. Evolutionary computation, 9(2), 159–195. https://doi.org/10.1162/106365601750190398
  11. [11] Črepinšek, M., Liu, S. H., & Mernik, M. (2013). Exploration and exploitation in evolutionary algorithms: A survey. ACM computing surveys (CSUR), 45(3), 1-33. https://doi.org/10.1145/2480741.2480752
  12. [12] Grimaccia, F., Mussetta, M., Niccolai, A., & Zich, R. E. (2018). Comparison of binary evolutionary algorithms for optimization of thinned array antennas. 2018 IEEE congress on evolutionary computation (CEC) (pp. 1-8). IEEE. https://doi.org/10.1109/CEC.2018.8477897
  13. [13] Coello, C. A. C. (2002). Theoretical and numerical constraint-handling techniques used with evolutionary algorithms: A survey of the state of the art. Computer methods in applied mechanics and engineering, 191(11–12), 1245–1287. https://doi.org/10.1016/S0045-7825(01)00323-1
  14. [14] Simon, D. (2008). Biogeography-based optimization. IEEE transactions on evolutionary computation, 12(6), 702–713. https://doi.org/10.1109/TEVC.2008.919004
  15. [15] Holland, J. H. (1975). Adaptation in natural and artificial systems: An introductory analysis with applications to biology, control, and artificial intelligence. University of Michigan Press. https://mitpress.mit.edu/9780262082136/adaptation-in-natural-and-artificial-systems/
  16. [16] Teodorovic, D., & Dell’Orco, M. (2005). Bee colony optimization–A cooperative learning approach to complex transportation problems. Advanced OR and AI methods in transportation, 51, 60. https://neuro.bstu.by/ai/To-dom/My_research/failed 1 subitem/For-courses/Job-SSP/Bee/ID161%5B1%5D.pdf
  17. [17] Atashpaz-Gargari, E., & Lucas, C. (2007). Imperialist competitive algorithm: An algorithm for optimization inspired by imperialistic competition. 2007 IEEE congress on evolutionary computation (pp. 4661-4667). IEEE. https://doi.org/10.1109/CEC.2007.4425083
  18. [18] Mirjalili, S., Mirjalili, S. M., & Lewis, A. (2014). Grey wolf optimizer. Advances in engineering software, 69, 46-61. https://doi.org/10.1016/j.advengsoft.2013.12.007
  19. [19] Heidari, A. A., Mirjalili, S., Faris, H., Aljarah, I., Mafarja, M., & Chen, H. (2019). Harris Hawks optimization: Algorithm and applications. Future generation computer systems, 97, 849–872. https://doi.org/10.1016/j.future.2019.02.028.
  20. [20] Reid, C. R., Lutz, M. J., Powell, S., Kao, A. B., Couzin, I. D., & Garnier, S. (2015). Army ants dynamically adjust living bridges in response to a cost-benefit trade-off. Proceedings of the national academy of sciences, 112(49), 15113–15118. https://doi.org/10.1073/pnas.1512241112
  21. [21] Kovenock, D., & Roberson, B. (2021). Generalizations of the General Lotto and Colonel Blotto games. Economic theory, 71(3), 997–1032. https://doi.org/10.1007/s00199-020-01272-2
  22. [22] Gross, O., & Wagner, R. (1950). A continuous Colonel Blotto game. https://www.rand.org/pubs/research_memoranda/RM408.html
  23. [23] Ayyarao, T. S., Ramakrishna, N. S. S., Elavarasan, R. M., Polumahanthi, N., Rambabu, M., Saini, G., ... & Alatas, B. (2022). War strategy optimization algorithm: A new effective metaheuristic algorithm for global optimization. IEEE access, 10, 25073-25105. https://doi.org/10.1109/ACCESS.2022.3153493
  24. [24] Rahkar Farshi, T. (2021). Battle royale optimization algorithm. Neural computing and applications, 33(4), 1139–1157. https://doi.org/10.1007/s00521-020-05004-4
  25. [25] Tzu, S., Adams, A., Griffith, S. B., & Sunzi. (1963). The art of war. Oxford University Press New York. https://global.oup.com/academic/product/the-art-of-war-9780195014761?cc=ir&lang=en&
  26. [26] Clausewitz, C. von. (1976). On war. Princeton University Press. https://press.princeton.edu/books/paperback/9780691018546/on-war?srsltid=AfmBOorX3uqI-Td-IqFu8eQxCU0a1-kO05lQRtP1UvTsUI5NQ_dHQ520
  27. [27] Jomini, A. H. (1971). The art of war. U.S. Army. https://catalog.hathitrust.org/Record/005099622
  28. [28] Liddell, H. B. H. (1991). Strategy. Penguin. https://www.biblio.com/9780452010710
  29. [29] Rommel, E. (1942). Infantry attacks: Experiences and lessons learned. L. Voggenreiter. (In German). https://www.amazon.de/-/en/Infanterie-greift-Erlebnis-Erfahrung-Feldpostausgabe/dp/B07CYKDCLQ
  30. [30] Guderian, H. (2018). Achtung-panzer! The development of the armored force, its combat tactics, and its operational possibilities. Verlag Traugott Bautz GmbH. (In German). https://www.amazon.com/Heinz-Guderian-Achtung-Panzer-M%C3%B6glichkeiten-Erstver%C3%B6ffentlichung/dp/3819096744
  31. [31] Lanchester, F. W. (1916). Aircraft in warfare: The dawn of the fourth arm. Constable & Company. https://en.wikisource.org/wiki/Aircraft_in_Warfare_(1916)
  32. [32] Waltz, K. N. (1979). Theory of international politics. Addison-Wesley. https://www.academia.edu/28686609/_WALTZ_KENNETH_Theory_of_International_Politics
  33. [33] Mearsheimer, J. J. (2001). The tragedy of great power politics. W. W. Norton & Company. https://www.amazon.com/Tragedy-Great-Power-Politics-Updated/dp/0393349276

Published

2024-06-17

Issue

Vol. 1 No. 2 (2024): Metaheuristic Algorithms with Applications

Section

Articles

Categories

How to Cite

Panda, S. ., & Adebisi, S. A. . (2024). Network War Strategy Optimization: A Military-Strategy-Inspired Metaheuristic with Reconnaissance, Tactical Engagement, and Adaptive Retreat. Metaheuristic Algorithms With Applications, 1(2), 181-207. https://doi.org/10.48313/maa.vi.62

Similar Articles

1-10 of 32

You may also start an advanced similarity search for this article.