Damage Maximization for Combat Network with Limited Costs

Maximizing the damage of combat network plays a vital role in identifying the important nodes in combat system-of-system (SOS). In order to protect or destroy the critical part of combat network more efficiently with less costs, here we report a more realistic model to study the combat network damage problems. As a first step, the cost and effect of damage are redefined based on the network topology and the functional characteristics of nodes according to practical significance, respectively. Then, the damage maximization model for combat network with limited costs is constructed. To obtain the optimal solution of the mathematical model, an improved genetic algorithm (IPGA) based on prior information is proposed. As a result, our proposed method has a significant advantage in the feasibility and effectiveness compared with other algorithms shown in the simulated experiments. Furthermore, the attack law of combat network is explored.

[1]  An elitism-based multi-objective evolutionary algorithm for min-cost network disintegration , 2021, Knowl. Based Syst..

[2]  Jun Tang,et al.  A Review on Representative Swarm Intelligence Algorithms for Solving Optimization Problems: Applications and Trends , 2021, IEEE/CAA Journal of Automatica Sinica.

[3]  Ruisheng Zhang,et al.  A sequential seed scheduling heuristic based on determinate and latent margin for influence maximization problem with limited budget , 2021 .

[4]  Hao Li,et al.  Finding Key Node Sets in Complex Networks Based on Improved Discrete Fireworks Algorithm , 2021, Journal of Systems Science and Complexity.

[5]  Jiang Jiang,et al.  Disintegration of Operational Capability of Heterogeneous Combat Networks Under Incomplete Information , 2020, IEEE Transactions on Systems, Man, and Cybernetics: Systems.

[6]  Yang Zhang,et al.  Optimal Disintegration Strategy With Heterogeneous Costs in Complex Networks , 2020, IEEE Transactions on Systems, Man, and Cybernetics: Systems.

[7]  Lei Zhang,et al.  Multi-Objective Optimization of Critical Node Detection Based on Cascade Model in Complex Networks , 2020, IEEE Transactions on Network Science and Engineering.

[8]  Erkin Diyarbakırlıoğlu Distance , 2020, SSRN Electronic Journal.

[9]  Chengai Sun,et al.  Scalable influence maximization based on influential seed successors , 2020, Soft Comput..

[10]  Xin-She Yang,et al.  Influence of Initialization on the Performance of Metaheuristic Optimizers , 2020, Appl. Soft Comput..

[11]  Dilip Kumar Pratihar,et al.  A survey on influence maximization in a social network , 2018, Knowledge and Information Systems.

[12]  Tao Wang,et al.  Optimal Disintegration Strategy in Multiplex Networks under Layer Node-Based Attack , 2019 .

[13]  Zhang Yi,et al.  IGD Indicator-Based Evolutionary Algorithm for Many-Objective Optimization Problems , 2018, IEEE Transactions on Evolutionary Computation.

[14]  Jun Wu,et al.  Optimal disintegration strategy in multiplex networks. , 2018, Chaos.

[15]  Manlio De Domenico,et al.  Distance Entropy Cartography Characterises Centrality in Complex Networks , 2018, Entropy.

[16]  Reuven Cohen,et al.  Optimal cost for strengthening or destroying a given network. , 2017, Physical review. E.

[17]  Yuejin Tan,et al.  A fast connected component algorithm based on hub contraction , 2016, 2016 IEEE International Conference on Systems, Man, and Cybernetics (SMC).

[18]  Jun Wu,et al.  Optimal attack strategy of complex networks based on tabu search , 2016 .

[19]  Alan M. Frieze,et al.  Random graphs , 2006, SODA '06.

[20]  Stephen P. Borgatti,et al.  Centrality and network flow , 2005, Soc. Networks.

[21]  K. Goh,et al.  Universal behavior of load distribution in scale-free networks. , 2001, Physical review letters.

[22]  Alessandro Vespignani,et al.  Epidemic spreading in scale-free networks. , 2000, Physical review letters.

[23]  S. Havlin,et al.  Breakdown of the internet under intentional attack. , 2000, Physical review letters.

[24]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[25]  J. Boyd,et al.  A Discourse on Winning and Losing , 1987 .

[26]  P. Erdos,et al.  On the evolution of random graphs , 1984 .