Damage Maximization for Combat Network With Limited Costs

نویسندگان

چکیده

Maximizing the damage by attacking specific nodes of combat network can efficiently disrupt enemies’ defense capability, protect our critical units, and enhance resistance to destruction system-of-system (SOS). However, modeling is not practical enough. In this paper, we report a more realistic model study maximization problems. By analyzing situations, cost redefined based on topology functional characteristics nodes. The effect also updated according operational capability. Hence, cost-limited for constructed. addition, obtain optimal solutions, an improved genetic algorithm (IPGA) prior information proposed. As result, method has significant advantage in feasibility effectiveness compared with other algorithms experiments. attack pattern convergence complexity proposed are further explored. algorithm, as well mined patterns, provide support military decisions.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Network Optimization with Concave Costs

In this paper the problem of minimum cost communication network design is considered where the costs are piecewise linear concave. Several methods are compared: Simulated Annealing method, a heuristic based on the method proposed by Minoux, and a lagrangian method based on lower bounding procedure.

متن کامل

Network Optimization with Concave Costs

In this paper the problem of minimum cost communication network design is considered where the costs are piecewise linear concave. Several methods are compared: Simulated Annealing method, a heuristic based on the method proposed by Minoux, and a lagrangian method based on lower bounding procedure.

متن کامل

Weapon scheduling in naval combat systems for maximization of defense capabilities

Air defense is a crucial area for all naval combat systems. In this study, we consider a warship equipped with an air-defense weapon that targets incoming threats using surface-to-air missiles. We define the weapon scheduling problem as the optimal scheduling of a set of surface-to-air missiles of a warship to a set of attacking air threats. The optimal scheduling of the weapon results in an in...

متن کامل

Distributed Submodular Maximization with Limited Information

We consider a class of distributed submodular maximization problems in which each agent must choose a single strategy from its strategy set. The global objective is to maximize a submodular function of the strategies chosen by each agent. When choosing a strategy, each agent has access to only a limited number of other agents’ choices. For each of its strategies, an agent can evaluate its margi...

متن کامل

Multivariate utility maximization with proportional transaction costs

We present an optimal investment theorem for a currency exchange model with random and possibly discontinuous proportional transaction costs. The investor’s preferences are represented by a multivariate utility function, allowing for simultaneous consumption of any prescribed selection of the currencies at a given terminal date. We prove the existence of an optimal portfolio process under the a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Access

سال: 2022

ISSN: ['2169-3536']

DOI: https://doi.org/10.1109/access.2022.3232175