战场抢修资源动态重组中的并发任务选择  

Choice for Parallel Battlefield Recovery Missions in Resource Reconfiguration System

作　　者：郭军[1] 古西睿[1] 宋建社[1] 杨檬[1] 

机构地区：[1]西安高技术研究所,西安710025

出　　处：《系统仿真学报》2010年第7期1596-1599,共4页Journal of System Simulation

基　　金：国家自然科学基金重点资助项目(69931040)

摘　　要：针对战时抢修资源不满足并发抢修任务需求时如何优选抢修任务的问题,首先,给出了抢修效益的定义,建立了以总抢修效益最大为目标的并发任务选择数学模型。然后,设计了一种结合基于总消耗率贪婪算法的混合遗传算法及相应的操作方案。最后,进行了仿真实验,结果表明了算法对问题的有效性。Aiming at the problem of optimize choice of battlefield recovery missions when recovery resources supply is unequal to requirement in wartime,firstly the definition of recovery benefit and the mathematical model of choosing parallel missions with maximum total recovery benefit were put forward.The hybrid GA algorithm and operating methods which combined greedy algorithm on the base of total consuming rate were introduced.The result of simulation shows that the algorithm is feasible.

关 键 词：并发抢修任务 选择 抢修效益 总消耗率 混合遗传算法 

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