In the military arms race, the focus of the defender is on selecting the optimal development plan of armaments, i.e., advantageous defense resources allocation. As an indispensable feature of armaments, the cooperative interactions between different armaments influence their effectiveness directly, but they have not been elaborated yet in the existing study. In this regard, a mathematical formulation, named operation loop, is proposed to investigate the cooperative interactions between armaments, sequentially facilitating the description of the development plans’ performance. Additionally, the defender’s development plans of armaments depend much on the attacker’s weapons, bringing the characteristics of multiobjective into this problem. Furthermore, the uncertainty about the development plans of the attacker has been taken into consideration as well. Therefore, the paper concentrates on formulating the resources allocation problem with incomplete information as a network design problem. By optimizing the network design using covariance matrix adaptation evolution strategy, an effective armaments development plan can be obtained. The feasibility is demonstrated by a case study.
Reliability evaluation of complex network is one of main topics in complex engineering systems, especially for Internet of Things (IoT). The reliability of IoT partially depends on its large-scale network. Especially, the lifetime distribution of large-scale network is critical for its health management. However, the large scale of the network usually leads to an expensive simulation time cost. Instead of direct simulation, we propose a method to infer the large-scale network lifetime using small-scale networks with the universal scaling function. We first find the scaling relationships between network lifetime and network size in a network model with failure coupling for two-dimensional square lattice network and Cayley tree network. Network lifetime with different size can be described by one universal scaling function. Then we perform theoretical analysis to derive the scaling relationships. Finally we apply these scaling relationships to wireless sensor network with coupled failures in more realistic situation as case study. From the simulation results of smaller-scale networks, we can infer the lifetime distribution of large-scale networks based on universal scaling function. The computation time and accuracy are compared with standard Monte Carlo simulation which shows that our method is faster and accurate. Our research shows that the proposed method using universal scaling functions can help us to infer the lifetime properties of large-scale networks with low computational cost. Our method can help fast reliability evaluations of large-scale complex networks with high accuracy.
The combat domain of modern warfare is becoming increasingly multidimensional. It is important to evaluate the resilience of the air-ground cooperative network for defending against attack threats and recovery performance. First, a resilience analysis model was proposed to effectively analyze and evaluate the resilience of the air-ground cooperative network. Then, considering the available resources, three dynamic reconfiguration strategies were given from the global perspective to help the air-ground cooperative network quickly recover performance and enhance combat capabilities. Finally, a typical 50-node network was taken as an example to prove the effectiveness and feasibility of the proposed model. The proposed method can provide scientific guidance for improving the air-ground cooperative network combat capabilities.
In three-dimensional (3D) logistics environments, finding optimal paths for unmanned aerial vehicles (UAVs) is challenging due to positioning inaccuracies that require ground-based corrections. These inaccuracies are exacerbated in harsh environments, leading to a significant risk of correction failure. This research proposes a multi-objective mixed integer programming model (MILP) that transforms dynamic uncertainties into binary constraints, utilizing a hierarchical sequencing strategy in the Gurobi optimizer to efficiently identify optimal paths. Our simulations indicate that achieving an 80% mission success probability necessitates an optimal path of 104,946 m with nine corrections. For a 100% success rate, the path length increases to 105,874 m, with corrections remaining constant. These results validate the model’s effectiveness in navigating environments with probabilistic constraints, highlighting its potential for addressing complex logistical challenges.
Complex networks rely on their structural robustness for their function and performance. Considering that redundancy backup is frequently used to enhance the robustness of complex networks, we try to find better redundancy backup strategy by using optimization methods. In this paper, our contributions are twofold. First, we prove that natural connectivity is suitable for measuring network robustness. Second, a robustness optimization algorithm is proposed based on GA, while it is different from traditional GA. The method of coding, crossover and mutation operations are all improved in this research. Extensive experiments on real-world datasets demonstrate that the effectiveness of our methods is better than the classical rich-rich redundancy backup strategy.