Solving flexible job shop scheduling problem by a multi-swarm collaborative genetic algorithm

The flexible job shop scheduling problem(FJSP),which is NP-hard,widely exists in many manufacturing industries.It is very hard to be solved.A multi-swarm collaborative genetic algorithm(MSCGA)based on the collaborative optimization algorithm is proposed for the FJSP.Multi-population structure is used to independently evolve two sub-problems of the FJSP in the MSCGA.Good operators are adopted and designed to ensure this algorithm to achieve a good performance.Some famous FJSP benchmarks are chosen to evaluate the effectiveness of the MSCGA.The adaptability and superiority of the proposed method are demonstrated by comparing with other reported algorithms.

Complex task planning method of space-aeronautics cooperative observation based on multi-layer interaction

With the new development trend of multi-resource coordinated Earth observation and the new goal of Earth observation application of“short response time,high observation accuracy,and wide coverage”,space-aeronautics cooperative complex task planning problem has become an urgent problem to be solved.The focus of this problem is to use multiple resources to perform collaborative observations on complex tasks.By analyzing the process from task assignment to receiving task observation results,we propose a multi-layer interactive task planning framework which is composed of a preprocessing method for complex tasks,a task allocation layer,a task planning layer,and a task coordination layer.According to the characteristics of the framework,a hybrid genetic parallel tabu(HGPT)algorithm is proposed on this basis.The algorithm uses genetic annealing algorithm(GAA),parallel tabu(PT)algorithm,and heuristic rules to achieve task allocation,task planning,and task coordination.At the same time,coding improvements,operator design,annealing operations,and parallel calculations are added to the algorithm.In order to verify the effectiveness of the algorithm,simulation experiments under complex task scenarios of different scales are carried out.Experimental results show that this method can effectively solve the problems of observing complex tasks.Meanwhile,the optimization effect and convergence speed of the HGPT is better than that of the related algorithms.

Cooperative Perception Optimization Based on Self-Checking Machine Learning

In the process of spectrum perception,in order to realize accurate perception of the channel state,the method of multi-node cooperative perception can usually be used.However,the first problem to be considered is how to complete information fusion and obtain more accurate and reliable judgment results based on multi-node perception results.The ideas put forward in this paper are as follows:firstly,the perceived results of each node are obtained on the premise of limiting detection probability and false alarm probability.Then,on the one hand,the weighted fusion criterion of decision-making weight optimization of each node is realized based on a genetic algorithm,and the useless nodes also can be screened out to reduce energy loss;on the other hand,through the linear fitting ability of RBF neural network,the self-inspection of the perceptive nodes can be realized to ensure the normal operation of the perceptive work of each node.What's more,the real-time training data can be obtained by spectral segmentation technology to ensure the real-time accuracy of the optimization results.Finally,the simulation results show that this method can effectively improve the accuracy and stability of channel perception results,optimize the structure of the cooperative network and reduce energy consumption.

Cooperative task assignment of multiple heterogeneous unmanned aerial vehicles using a modifed genetic algorithm with multi-type genes

The task assignment problem of multiple heterogeneous unmanned aerial vehicles （UAVs）, concerned with cooperative decision making and control, is studied in this paper. The heterogeneous vehicles have different operational capabilities and kinematic constraints, and carry limited resources （e.g., weapons） onboard. They are designated to perform multiple consecutive tasks cooperatively on multiple ground targets. The problem becomes much more complicated because of these terms of heterogeneity. In order to tackle the challenge, we modify the former genetic algorithm with multi-type genes to stochastically search a best solution. Genes of chromo- somes are different, and they are assorted into several types according to the tasks that must be performed on targets. Different types of genes are processed specifically in the improved genetic operators including initialization, crossover, and mutation. We also present a mirror representation of vehicles to deal with the limited resource constraint. Feasible chromosomes that vehicles could perform tasks using their limited resources under the assignment are created and evolved by genetic operators. The effect of the proposed algorithm is demonstrated in numerical simulations. The results show that it effectively provides good feasible solutions and finds an optimal one.

酿酒葡萄生长全过程多任务多农机调度研究

针对酿酒葡萄生长全过程中存在多任务多农机调度的需求,而传统调度研究很少有针对酿酒葡萄的多农机多任务协同作业研究。为此,结合作业田块相关信息与农机信息,基于车辆路径规划问题(Vehicle Routing Problem,VRP),以成本最优为目标构建酿酒葡萄生长全过程多任务多农机调度模型,提出改进自适应遗传算法(Improved Adaptive Genetic Algorithm,IAGA)进行运算求解;结合宁夏贺兰山东麓酿酒葡萄产区实际作业田块信息与农机信息进行仿真实验,并与传统遗传算法(Genetic Algorithm,GA)进行对比。研究结果表明:相比于GA,IAGA有着较强的收敛性,不易陷入局部最优,在调度结果上,调度总时间上能够缩短2.22%,在农机调度总成本降低2.32%,在酿酒葡萄实际作业中能够极大地节约作业时间并降低作业成本。

HEURISTIC QUANTUM GENETIC ALGORITHM FOR AIR COMBAT DECISION MAKING ON COOPERATIVE MULTIPLE TARGET ATTACK

In order to achieve the optimal attack outcome in the air combat under the beyond visual range(BVR)condition,the decision-making(DM)problem which is to set a proper assignment for the friendly fighters on the hostile fighters is the most crucial task for cooperative multiple target attack(CMTA).In this paper,a heuristic quantum genetic algorithm(HQGA)is proposed to solve the DM problem.The originality of our work can be supported in the following aspects:(1)the HQGA assigns all hostile fighters to every missile rather than fighters so that the HQGA can encode chromosomes with quantum bits(Q-bits);(2)the relative successful sequence probability(RSSP)is defined,based on which the priority attack vector is constructed;(3)the HQGA can heuristically modify quantum chromosomes according to modification technique proposed in this paper;(4)last but not the least,in some special conditions,the HQGA gets rid of the constraint described by other algorithms that to obtain a better result.In the end of this paper,two examples are illustrated to show that the HQGA has its own advantage over other algorithms when dealing with the DM problem in the context of CMTA.

基于改进离散模拟退火遗传算法的雷达网协同干扰资源分配模型

针对分布式干扰机掩护目标突防雷达网背景下的干扰资源分配问题,提出了一种引入随机密钥的改进离散模拟退火遗传算法(improved discrete simulated annealing genetic algorithm,IDSA-GA)对资源分配过程进行优化。基于雷达网融合检测概率构建干扰效果评估函数,利用IDSA-GA对函数寻优求解。IDSA-GA在模拟退火遗传算法(simulated annealing genetic algorithm,SA-GA)的基础上引入随机密钥,完成算法的离散化;并在迭代的过程中增加记忆功能,克服了过早收敛的现象。仿真结果表明,与GA相比,提出的IDSA-GA收敛迅速,寻优能力强,能有效解决干扰资源优化分配问题。

汽车门板内饰多机器人焊接的动态协同规划

为了减小多机器人协同焊接的路径长度并提高机器人之间的负载均衡度,提出了基于动态规划-个体差异进化遗传算法的协同焊接规划方法。以多机器人协同焊接路径长度、负载均衡度为优化目标建立了优化模型,并分析了协同焊接约束条件。针对单机器人焊接路径规划问题,在遗传算法中针对染色体进化能力的差异性,提出了个体差异进化策略,给出了基于个体差异进化遗传算法的路径规划方法。针对多机器人协同焊接问题,使用动态规划将其划分为3个子问题,实现了多机器人协同焊接任务分配和路径规划。经某型汽车前门焊点路径规划验证,个体差异进化遗传算法规划的路径最佳长度、平均长度均优于传统遗传算法;经后门焊点的4机器人协同焊接验证,在满足无干涉约束下,这里方法的路径长度、负载均衡度优于文献[11]离散粒子群算法。实验验证了这里方法在多机器人协同焊接分配和规划问题中的优越性。

苹果园内无人割草机多机协同作业路径优化算法

[目的]提高新型苹果园内多台无人割草机协同作业时的工作效率。[方法]提出一种改进的遗传算法(Improved genetic algorithm, IGA),为每台割草机分配并优化作业路径。根据实际无人割草机作业情况,以总转弯时间和作业时长为综合优化目标,构建无人割草机多机作业路径优化模型。通过设定任务阈值,引入改良圈策略和Metropolis准则改进遗传算法(Genetic algorithm, GA)以求解模型。[结果]仿真试验结果表明,IGA为每台割草机分配的任务量均衡,与GA相比,IGA优化后的矩形果园路径平均总转弯时间和作业时长分别减少22.89%和19.36%;与分区作业相比,IGA优化后的矩形果园路径平均总转弯时间和作业时长分别减少45.53%和10.68%。在梯形果园中,IGA不受果树分布影响,与GA和分区作业相比,平均总转弯时间分别减少14.38%和34.08%,平均作业时长分别减少23.71%和10.07%。[结论]所提出的IGA性能更好,能有效优化机群的作业路径,缩短作业时长,提高作业能力。

多弹集群协同优化决策算法研究

本文以集群对海作战为应用背景,为重点解决多弹多空间散布的时空构型及目标分配决策问题,建立了多弹典型协同场景下的导弹主动感知协同探测模型,设计了导弹协同探测与协同攻击的模型以及相应的算法。首先,建立了导弹三自由度和舰船二自由度模型、导弹飞行能力评估模型、导弹突防概率评估模型和导弹威胁度评估模型,使得对导弹执行探测和打击任务中能力的变化度量更加精确。其次,设计导弹在不完全信息条件下的主动感知协同探测模型和协同攻击模型,保证导弹协同作战的效益最大化,最大限度地打击敌方势力。再次,针对导弹协同打击目标分配和导弹编队构型问题,使用融合了遗传算法的粒子群(GAPSO)算法问题进行求解,并与传统的粒子群(PSO)算法进行了对比,实现了多方位考虑战场态势信息,对敌方目标进行探测攻击一体化打击。最后,对建立的作战模型进行仿真,得到算法仿真图和算法多次仿真的统计数据。相比其他算法,该算法具有一定的优越性,大幅提升了导弹的智能化对抗水平和突防打击能力。

A Cooperation-planning Model Based on Bilevel Programming Decision

This paper is based on a resource constrained active network project;the constraint of the local resource and the time constraint of the cooperation resource are considered simultaneously.And the respective benefit of the manager and cooperation partners is also considered simultaneously.And a cooperation planning model based on bilevel multi-objective programming is de- signed,according to the due time and total cost.And an extended CNP based on the permitted range for resource and time requests is presented.A larger task set in scheduling cycle is on the permitting for the request of cooperation resource and time while the task manager itself may be permitted biding for tasks.As a result,the optimization space for the cooperation planning is enlarged.So not every bidding task is successfully bid by invitee,and the task manager itself takes on some bidding tasks.Finally,the genetic algorithm is given and the validity and feasibility of the model is proved by a case.

考虑同时取送货的车机协同路径优化问题

考虑到传统同时取送货问题模式单一,无法应对复杂多变情况的现实需要,研究了一种考虑同时取送货的路径优化问题(vehicle routing problem with drones for simultaneous pickup and delivery, VRPD-SPD)。首先,以车辆与无人机总成本最小为优化目标,建立了考虑无人机单架次访问顺序约束的混合整数线性规划模型。其次,提出了一种基于遗传思想的两阶段启发式算法(two-stage heuristic algorithm based genetic, TSHAG),第一阶段结合贪婪算法和节约算法生成初始解,第二阶段通过改进的遗传算法优化初始解,设计了多元组编码方式来提高解码效率,改进了交叉算子来增加邻域解的搜索空间,设计了新的变异算子来提高算法全局寻优性能。最后,算例实验结果表明了TSHAG算法能够有效地解决VRPD-SPD问题。

基于博弈建模的地对空防御火力分配策略选择

战场环境复杂多变,如何根据当前态势及火力资源特点,及时有效地对来袭目标进行火力分配,是防空指挥中的关键环节。针对地对空防御问题,考虑对敌方来袭目标的毁伤程度和我方武器资源消耗因素,以最大化总体毁伤概率和最小化使用武器价值为目标建立多目标优化模型。由于优化目标之间存在对武器资源的竞争,以优化目标为博弈方,以决策武器如何攻打来袭目标为策略,建立非合作博弈模型,并结合禁忌搜索技术,设计基于纳什均衡搜索的改进遗传算法(NE-IGA)进行求解。实验结果表明,与求解优化模型的基于禁忌搜索的改进遗传算法(TSGA)及基本遗传算法(GA)相比,博弈模型及其求解算法NE-IGA能够得到更优的分配方案。

基于遗传-蚁群融合算法的干扰资源分配方法

针对多部干扰机协同干扰多部雷达的干扰资源分配问题,提出一种基于遗传-蚁群融合算法的干扰资源分配算法。首先采用综合集成赋权法结合逼近理想解排序法(technique for order preference by similarity to an ideal solution,TOPSIS)对目标雷达进行威胁评估,然后建立干扰资源多约束优化分配模型,最后采用遗传-蚁群融合算法对模型进行求解。融合算法利用遗传算法快速寻找出若干组优化解,将这些优化解用于调整蚁群算法中初始信息素的分布,利用蚁群算法对问题进一步优化,从而找到最优解,提升了算法的求解精度和求解时间。仿真结果表明,融合算法的性能在收敛速度和寻优准确性等方面相较于其他算法都有了较大提升。

基于并行协同的多车间协同调度问题研究

传统企业在实际生产中,其多个关联车间之间的生产计划与调度存在难以协作的问题。为此,针对多车间协同调度问题建立了调度模型,提出了一种多车间协同调度的并行协同进化遗传算法(PCE-GA),并且采用该算法对上述模型进行了求解。首先,以最小化订单完工时间为目标,建立了单目标调度模型;然后,采用了并行协同进化遗传算法,对上述单目标调度模型进行了求解,基于工件、机器、装配关系的三层整数编码的染色体编码方案,提出了一种协同适应度值计算的方法;最后,以某液压缸生产企业为例,针对单目标调度问题,采用该算法与单车间遗传算法(JSP-GA)、并行协同模拟退火算法(PCE-SA)分别进行了求解,并对其结果进行了比较,以验证PCE-GA算法的优越性。研究结果表明:采用PCE-GA算法得到的优化率为13.3%,比单车间作业调度遗传算法求解的数据优化11.5%,该结果证明了PCE-GA算法在解决多车间协同优化问题时的优越性。

深空环境中基于云边端协同的任务卸载方法

深空探测是当今世界航天任务的重要领域,深空探测自主技术对未来进行大规模的深空探测具有重大意义。由于深空环境复杂且未知,通信时延长,星上计算资源有限,深空探测自主技术面临严峻挑战。针对此问题,提出了一种面向深空探测任务的数字孪生云边端协同框架,通过云边端协同的任务卸载,为深空探测自主技术提供更加高效的资源服务。首先将复杂深空探测任务分解为多个具有依赖关系的子模块,然后在虚拟空间层分别建立环绕器覆盖时间模型、协同计算模型和模块依赖模型,最后基于以上模型构建了相应的目标优化问题。优化目标是在模块依赖、环绕器的有效通信服务时间以及着陆巡视器发射功率控制约束条件下,最小化着陆巡视器完成深空探测任务的能耗和时间。为了解决该优化问题,提出了一种自适应遗传算法,以确定最优的执行策略交由物理空间层的着陆巡视器执行。仿真结果表明,所提出的自适应遗传算法可以有效减少任务完成时间和能耗。此外,将所提的云边端协同计算模式与另外3种计算模式进行了对比,结果表明,在完成相同目标的情况下,所提的云边端协同框架具有更高的资源利用率。

基于CEA-GA的多无人机三维协同曲线航迹规划方法

针对多无人机协同航迹规划求解计算复杂度高,收敛效率差等问题,提出一种基于混沌精英适应遗传算法(CEA-GA)的多无人机三维协同曲线航迹规划方法。利用层级规划思想,建立基于单机规划层-航迹平滑层-多机协同规划层的多无人机三维协同曲线航迹层级规划模型,将复杂约束规划问题分解为子函数优化求解问题,减小计算量;考虑到遗传算法(GA)求解高维复杂约束优化问题存在的性能局限,采用Tent混沌映射均匀初始化种群,以扩大个体搜索空间,丰富种群多样性,在此基础上,通过引入自适应遗传算子平衡算法的全局搜索与局部开发能力,帮助个体跳出局部最优,并采用适应度动态更新策略进一步提高算法的局部探索能力和收敛速度。将精英保留策略引入GA以更好地保证改进算法的全局收敛性。将CEA-GA应用于模型求解,仿真实验结果表明:CEA-GA具有较强的鲁棒性、较好的寻优性能和收敛效率,且能够为集群规划满足约束条件的协同曲线航迹,从而验证了所提方法的有效性和CEA-GA的优越性。

基于智能优化的协作治疗调度算法

为解决医院在有限医疗资源条件下多部门协作治疗病人的调度问题,提出了一种基于智能优化的协作治疗调度算法。该算法将医生、护士和病人在不同场景下的协作治疗调度问题视为多角色的协同控制问题,为了优化角色的访问行为,提出了用于指导角色作出最优访问行为的决策模型,并引入智能优化算法优化决策模型。针对协作治疗病人、医生探查病房、病人体检的案例场景,实验对比基于随机、最短距离、最大空闲空间、决策模型的4种调度策略,并对比分析使用遗传算法、粒子群算法、模拟退火和差分演化在优化决策模型的性能表现。实验结论证明,基于差分演化算法对决策模型优化的性能表现最优,且其优化得出的决策模型在案例场景中均能找到可行解且调度结果更优。

基于权系数法的功率和载荷协同控制策略

针对大型风机在高风速区由风剪切效应引起的输出功率波动和叶轮不平衡载荷,从功率和载荷两个维度出发,以美国国家可再生能源实验室(National Renewable Energy Laboratory,NREL)公司的5 MW陆基风机为对象,提出一种基于权系数法的功率和载荷双目标协同的独立变桨控制策略。首先,以遗传算法优化的比例、积分和微分(proportional integral derivative,PID)作为主控制器,通过风轮转速反馈得到统一变桨距角;其次,根据方位角反馈得到各桨叶的动态权系数,以此调整各桨叶的桨距角;最后,将叶根挥舞力矩反馈给模糊PID控制器得到载荷影响下的桨距角微调量,并对桨距角进行修正。通过FAST和MATLAB/Simulink平台联合仿真,将所提控制策略与统一变桨距控制和独立变桨PI控制对比分析。结果表明,所提控制策略能有效地将输出功率稳定在额定功率附近,并且对于降低风轮不平衡载荷具有显著效果。

合作型协同进化遗传算法求解分布式柔性作业车间调度问题

针对以最小化最大完工时间为优化目标的分布式柔性作业车间调度问题,提出一种合作型协同进化遗传算法。采用工厂分配和工序排序解耦编码,基于机器负荷解码并基于工厂负荷初始化种群,使算法在较优的解空间内迭代搜索。利用分而治之的思想,将问题分解为多个子问题,通过随机协同机制促进子种群协同进化并提高全局搜索能力。使用基于关键工厂的多重局部扰动策略,提高算法的局部开发能力。在基准实例上进行实验,并与其他算法进行对比,验证了所提算法的有效性。