一种基于多目标多约束的战时抢修力量调度  

Battle Repair Unit Scheduling with Multi-Objective and Multi-Constraints

作　　者：王锐[1] 李羚伟[1] 郭波[1] 马武彬[1] 

机构地区：[1]国防科学技术大学信息系统与管理学院,湖南长沙410073

出　　处：《兵工自动化》2010年第1期34-37,共4页Ordnance Industry Automation

基　　金：国家自然科学基金(70501031)

摘　　要：为合理调度抢修力量,快速修复受损装备,在对战场抢修中抢修力量调度问题进行分析的基础上,考虑抢修任务的时间约束、逻辑约束、抢修力量的平衡度约束、抢修力量的能力、抢修花费代价等约束,建立了使作战单元战斗力恢复最大,抢修花费代价最小的多目标优化模型。同时,给出了战时作战单元战斗力指数、抢修花费代价的计算方法,设计了相应遗传算法对模型优化求解。最后,以战场抢修任务为背景,用算例验证了模型的实用性和算法的有效性。In order to schedule the battle repair unit properly and repair the damaged equipments quickly, according to the analysis on battle repair unit scheduling in BDAR, under the constraints of urgent rush-repair mission finishing time, the logic relation between urgent rush-repair missions, the urgent rush-repair resources ability, the balance among resources, the repair cost, then, a optimal model to maximize the combat resilience recover and minimize the repair cost is established. A method of computing battle unit ability and the repair cost is studied; then, an algorithm based on GA for the model is presented in detail. Finally, based on battlefield repair task, an example is given to validate the model practicability and the solution validity.

关 键 词：多目标 战场抢修 调度 遗传算法 

分 类 号：O224[理学—运筹学与控制论] N945.16[理学—数学]