To solve the weapon network system optimization problem against small raid objects with low attitude,the concept of direction probability and a new evaluation index system are proposed.By calculating the whole damagin...To solve the weapon network system optimization problem against small raid objects with low attitude,the concept of direction probability and a new evaluation index system are proposed.By calculating the whole damaging probability that changes with the defending angle,the efficiency of the whole weapon network system can be subtly described.With such method,we can avoid the inconformity of the description obtained from the traditional index systems.Three new indexes are also proposed,i.e.join index,overlap index and cover index,which help manage the relationship among several sub-weapon-networks.By normalizing the computation results with the Sigmoid function,the matching problem between the optimization algorithm and indexes is well settled.Also,the algorithm of improved marriage in honey bees optimization that proposed in our previous work is applied to optimize the embattlement problem.Simulation is carried out to show the efficiency of the proposed indexes and the optimization algorithm.展开更多
针对物流云服务模式中调度任务多、信息量大、需求广的特点,提出了一种改进蝙蝠算法求解物流云服务调度问题的方案,其优化目标为最小化调度时间和最大化资源利用率。根据设计的算法流程,首先基于工件升序排列(ranked order value,ROV)...针对物流云服务模式中调度任务多、信息量大、需求广的特点,提出了一种改进蝙蝠算法求解物流云服务调度问题的方案,其优化目标为最小化调度时间和最大化资源利用率。根据设计的算法流程,首先基于工件升序排列(ranked order value,ROV)规则对蝙蝠个体进行重新编码;然后调整初始化数据范围来减少分配任务超载和资源闲置现象,并在迭代过程中增加约束条件来均衡任务量,最终实现了资源与任务的智能调度。通过和遗传、粒子群以及基本蝙蝠算法的对比分析,体现了改进算法的优越性。最后利用Witness对方案进行仿真,证明了改进蝙蝠算法在解决物流云服务任务调度中的有效性,同时扩展了蝙蝠算法的应用领域。展开更多
基金Sponsored by Beijing Priority Laboratory Fund of China(SYS10070522)
文摘To solve the weapon network system optimization problem against small raid objects with low attitude,the concept of direction probability and a new evaluation index system are proposed.By calculating the whole damaging probability that changes with the defending angle,the efficiency of the whole weapon network system can be subtly described.With such method,we can avoid the inconformity of the description obtained from the traditional index systems.Three new indexes are also proposed,i.e.join index,overlap index and cover index,which help manage the relationship among several sub-weapon-networks.By normalizing the computation results with the Sigmoid function,the matching problem between the optimization algorithm and indexes is well settled.Also,the algorithm of improved marriage in honey bees optimization that proposed in our previous work is applied to optimize the embattlement problem.Simulation is carried out to show the efficiency of the proposed indexes and the optimization algorithm.
文摘针对物流云服务模式中调度任务多、信息量大、需求广的特点,提出了一种改进蝙蝠算法求解物流云服务调度问题的方案,其优化目标为最小化调度时间和最大化资源利用率。根据设计的算法流程,首先基于工件升序排列(ranked order value,ROV)规则对蝙蝠个体进行重新编码;然后调整初始化数据范围来减少分配任务超载和资源闲置现象,并在迭代过程中增加约束条件来均衡任务量,最终实现了资源与任务的智能调度。通过和遗传、粒子群以及基本蝙蝠算法的对比分析,体现了改进算法的优越性。最后利用Witness对方案进行仿真,证明了改进蝙蝠算法在解决物流云服务任务调度中的有效性,同时扩展了蝙蝠算法的应用领域。
