改进入侵杂草算法求解柔性作业车间调度问题  

Improved Intrusion Weed Algorithm for Solving Flexible Job Shop Scheduling Problem

作　　者：张新 李珂 严大虎 纪志成 Zhang Xin;Li Ke;Yan Dahu;Ji Zhicheng(Engineering Research Center of Internet of Things Technology Applications Ministry of Education,Jiangnan University,Wuxi 214122,China)

机构地区：[1]江南大学教育部物联网技术应用工程中心,江苏无锡214122

出　　处：《系统仿真学报》2018年第11期4469-4476,共8页Journal of System Simulation

基　　金：江苏省产学研联合创新资金-前瞻性联合研究项目(BY2016022-24)

摘　　要：将入侵杂草算法用于解决考虑工件释放时间、工件交货期的柔性作业车间调度问题,以工件的最大完工时间、最大机器负荷、机器总负荷为优化目标建立了多目标柔性作业车间调度模型,提出了一种改进的入侵杂草优化算法。提出一种基于转化序列的随机键编码方式,实现杂草连续空间与FJSP离散空间之间的映射。在种子繁殖阶段,通过引入自适应高斯变异算子来增加种群多样性。接着,在种群扩散阶段,借助Levy飞行随机游走策略提高算法全局搜索能力,跳出局部最优解。最后,通过对比实验证明算法对于求解多目标柔性作业车间调度问题是有效的。An improved invasive weed optimization algorithm is proposed for solving multi-objective flexible job shop scheduling problem （FJSP） with released time and delivery date. The minimum completion time of jobs, the maximum work load of machines and the total work load Of all machines are taken as the optimization goals to establish a FJSP model. A random key encoding scheme based on transformed sequences is proposed and a mapping relationship is set up between the continuous space and the discrete space of FJSP. An adaptive Gauss mutation operator is introduced to diversify the population in the process of weed breeding. In spatial diffusion stage, the principle of Levy flight is taken to improve the global search ability, which contributes to escape from local optimal solution. The algorithm is compared with other different algorithms and the statistical results show that the algorithm is effective for solving the multi-objective FJSP.

关 键 词：柔性作业车间调度 杂草优化 自适应高斯变异 Levy飞行 随机键编码 

分 类 号：TP391.9[自动化与计算机技术—计算机应用技术]