Abstract:

In the offensive operation, equipment is constantly being damaged, but the battlefield rushrepair time and power are limited. Therefore, a real military problem is put forward as follows. In order to get more fighting time for damaged vehicles to participate in operation again as much as possible, the problem is how to dynamically choose the most suitable damaged equipment for each repair group, how to divide tasks between different groups, and how to determine execution sequence in the same group. Then the dynamic battlefield-rush-repair-task scheduling problem in the offensive combat is abstracted as a new problem. Its mathematical model is established and a variant genetic algorithm is designed to solve it. A scheduling example is solved by using Matlab with 28 equipment to be repaired and 3 repair groups. Results show that the proposed model is scientific and reasonable, and the algorithm is convenient and efficient, which can dynamically track the change of the optimal solution.