A decision-making method for reorganization and optimization of battlefield emergency repair resources

Abstract

The invention relates to a battle field first-aid repair resource reorganization optimized decision method which is used for resource reorganization decisions of multi-task and multi-resource requirements and distributed type multi-resource-point supply. Firstly, a common battle field first-aid repair resource reorganization decision is initialized through a constraint propagation method, and inconsistent first-aid repair task variables and reorganization resource variables are reduced. Then according to requirement conflicts of first-aid repair tasks and first-aid repair resources in first-aid repair time, resource reorganization decisions are divided into three categories of non-conflict, complete-conflict and incomplete-conflict, on the basis that first-aid repair resource points are the minimum, flexibility of remained first-aid repair resources is the largest, the total consumption rate is the minimum and other elicitation rules, mixed algorithms which are minimum in total consumption rate and based on a binary discrete particle swarm algorithm are respectively designed according to category characteristics of different decisions. Finally, reorganization time value assignment strategies which begin at the same time, are closed at the same time, and are finished on time and the like are designed. The battle field first-aid repair resource reorganization optimized decision method aims at solving multi-task resource requirement conflicts in combined guarantee of existing systematic confrontation, so that a set of optimization value assignment scheme of first-aid repair tasks and reorganization resources and reorganization time can be generated in systematic and complete modes, and theoretical support and decision basis are provided for decision staff.

Description

technical field [0001] The present invention relates to a decision-making method for reorganization of battlefield emergency repair resources. After establishing the goal of maximizing system emergency repair benefits, an optimal solution that satisfies constraints is found. The constraint conditions include time constraints in continuous domains and resource constraints in discrete domains. A combinatorial optimization optimization problem with background significance, combined with deterministic heuristic algorithms such as the minimum total resource consumption rate and resource flexibility, and probabilistic heuristic algorithms such as particle swarms, can be used for variables such as emergency repair tasks, reorganization resources, and reorganization time Assigning values ​​to optimize decision-making has a good application prospect in joint support in response to system confrontation. Background technique [0002] Combinatorial optimization is to find the optimal ar...

AI Technical Summary

Problems solved by technology

Generally speaking, the deterministic heuristic algorithm has a good calculation speed, but with the increase of the number of variable assignment combinations, the calculation accuracy is poor, while the probabilistic heuristic algorithm may have problems when solving the constrained combinatorial optimization problem. A large number of infeasible solutions will affect the calculation accuracy and calculation speed

Images