摘要
针对空中多编组任务分配具有整体任务完成时间限制和个体任务完成时窗限制的特点,以最高任务执行效率为目标,建立了包含时限约束的多编组任务分配数学模型。分析编组在作战过程中的资源损耗,构建了编组资源能力动态更新模型,使所建模型更为符合实际作战。在动态列表规划选择任务、量子遗传算法分配编组的基础上,设计了用于求解该模型的循环嵌套动态列表规划(CNDLS)的任务分配方法。针对作战想定进行仿真计算,仿真结果表明所建模型和所提方法能通过多次迭代可实现一定资源和时限约束下的最佳多编组任务分配。
Aimed at the characteristic of whole task completion time constraint and single task time window constraint of task allocation in multiple aerial grouping,the time constraint mathematical model in pursuit of maximal task execute efficiency is established.The wastage of group resource in combat is analyzed,and grouping resource capability dynamical renewal model is built so as to make the model adapt to the realistic situation.The circulative Nested-DLS task allocation algorithm is advanced based on nested dynamic list scheduling,in which the dynamic list scheduling selected task and the quantum genetic algorithm chosen best group for the task.At last,the superiority and applicability of this approach are illuminated by using the simulation of campaign assumption.
出处
《空军工程大学学报（自然科学版）》
CSCD
北大核心
2013年第5期21-26,共6页
Journal of Air Force Engineering University(Natural Science Edition)
基金
国家自然科学基金资助项目(70771157
61273048)
空军工程大学信息与导航学院博士创新基金资助项目(KDY2011-002)
关键词
任务分配
循环嵌套动态列表规划
个体任务时窗限制
任务完成时间限制
优先权系数
group task allocation
circulative nested dynamic list scheduling
task priority coefficient
group priority coefficient
time window constraint
task completion time constraint
