检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:王坚浩 张亮[1] 史超[1] 车飞 张鹏涛[1] WANG Jian-hao;ZHANG Liang;SHI Chao;CHE Fei;ZHANG Peng-tao(Equipment Management and Unmanned Aerial Vehicles Engineering College, Air Force Engineering University,Xi'an 710051, China)
出 处:《控制与决策》2019年第7期1375-1384,共10页Control and Decision
基 金:国家自然科学基金项目(61503409)
摘 要:针对装备保障编组协同任务规划问题,构建以时效优先为目标,考虑保障任务时序逻辑关系、任务执行质量和保障编组占用冲突等复杂约束以及保障编组能力更新机制的数学模型,提出一种基于入侵杂草蝙蝠混合算法的双子群任务规划方法。首先,采用佳点集初始化方法,在解空间生成具有均匀分布特征的种群;其次,设计具有修复操作的解编码和任务优先排序,实现任务-编组-时间的匹配和冲突消解;再次,划分双子群,利用入侵杂草优化算法和Fuch混沌蝙蝠优化算法协同进化;最后,应用重组算子引导种群进化,均衡算法全局探索和局部搜索能力。仿真算例表明,所提方法可对大规模复杂任务分配方案进行精确高效的求解。This paper proposes a hybrid task scheduling method based on the invasive weed bat algorithm upon dualsubpopulation to achieve objective of minimal task implementation time for equipment support groups cooperative task scheduling. The mathematical model is constructed considering complex constrains such as task sequential logical relationship, implementation quality, occupancy conflicts and capability renewal mechanism of support groups. Firstly,the good-point set theory is used to generate initial population with uniform distribution in the solution space. Then,the strategies of repair operator encoding and task priority ordering are designed to achieve tasks-groups-time sequential matching and conflict resolution. Moreover, all individuals are divided into dual-subpopulation by cooperative evolution using the invasive weed optimization algorithm and the Fuch chaotic bat optimization algorithm. Finally, the recombination operator for guiding population evolution is given to balance the exploration and exploitation ability. The simulation example is given to illustrate that the proposed method has better robustness and solving precision for the complicated task allocation scheme.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:52.15.109.247