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

Abstract

This paper proposes Network War Strategy Optimization (NWSO), a novel nature-inspired metaheuristic algorithm for solving continuous global optimization 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 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: PSO, GA, DE, GWO, WOA, NSGA-II, MOEA/D, ACO, TLBO, GSA, 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 global optimization, with broad applicability to engineering design, machine learning hyperparameter tuning, and scientific computing.