Schedule of Wartime Maintenance Unit Based on Dynamic Programming

Schedule of Wartime Maintenance Unit Based on

Dynamic Programming

GE Hong-yu(戈洪宇)*, SHI Quan(石 全), XIA Wei(夏 伟), WU Yu-tao(武禹陶)

【摘 要】Abstract: In order to solve the problems of scheduling the maintenance units in the battlefield, the dynamic programming method in model construction is used; the composition of dynamic planning process is explained; and the maintenance unit allocation model is established. By the solved dynamic programming model, the best allocation strategy for maintenance unit obtained in the battlefield will provide a basis for making maintenance unit allocation decisions in the future battlefield.【期刊名称】东华大学学报（英文版）【年(卷),期】2016(033)002【总页数】4

【关键词】Key words: dynamic programming; maintenance unit; intelligent decision support

CLC number: TJ07Document code: A

Article ID: 1672-5220(2016)02- 0296- 04Introduction

Since the Middle East war, the importance of battlefield damage assessment and repair (BDAR) has been paid a lot of attention to. It becomes a key point of the war on how to improve the combat effectiveness and put the equipment into the battle again. Maintenance unit as the main force of recovery equipment operational capability, its distribution scheduling influences the speed of maintenance and the time that the equipment returns to the battlefield. What’s more, it’s greatly important to make correct evaluation of equipment damage based on the correct maintenance strategy[1] in real situation and allocate the maintenance unit. Li et al.[2-3], Zhang et al. [4] and Cai et al.[5] used genetic algorithm[6], improved particle swarm optimization algorithm[7] and ant colony algorithm[8] to solve the battlefield maintenance unit scheduling model, and improved the efficiency of solving problem. Jiang and Liang[9] considered the

effectiveness of maintenance unit scheduling, and put forward the efficiency targets of