多编组任务分配动态优化模型及 IVFSA算法求解

摘要

The aim of this study is to provide a solution to dynamical optimization of aerial multiple grouping task allocation .According to time window feature of some tasks and the characteristics of resource wastage of groups,a mathematical model was established,which satisfied the former constraints and took the maximized task execution efficiency as the objective .An improved very fast simulated annealing algorithm ( IVFSA) was developed to solve the sub-optimized problem .Solution coding,neighborhoods creating and conflict solving methods were proposed,then the random greedy search measure at high temperature,re-annealing mechanism,tabu policy and elitist reserved policy were applied,thus the IVFSA could improve computing efficiency and avoid local optimum solutions .At last,the superiority and applicability of this approach are proved by the simulation of assumption .%针对作战智能体多编组协同作战中任务分配的动态优化问题，考虑到空中突击作战中部分任务的时间窗口属性和编组资源能力损耗的特点，建立了以任务执行效率为目标、满足上述约束问题的数学模型。设计了一种改进快速模拟退火对动态优化模型予以求解，给出解方案表达、邻域解生成、冲突消解等步骤，采用高温随机贪婪搜索、回火技术、禁忌设计和精英保留策略，避免算法陷入局部最优，提高算法的计算效率。仿真表明，所提方法可对多编组任务分配动态优化模型进行快速有效求解。