摘要
针对以最大完工时间最小化为目标的柔性作业车间调度问题(Flexible job shop scheduling problem,FJSP),提出一种混合遗传蝙蝠算法(HGBA).为了提高初始种群的质量与多样性,采用三种方式相结合产生初始群体;重定义惯性权重,采用动态递减的权值来平衡局部搜索与全局搜索;针对算法易陷入局部最优解的缺点,结合遗传算法的变异操作,提出一种基于变异操作的邻域搜索算法;同时根据编码方式以及位置更新可能造成的无效解情况,利用遗传算法的交叉操作提出混合列交叉方法来完成位置更新;最后,通过三个实例测试了算法的性能,实验结果验证了提出的算法在求解FJSP时的有效性.
In this paper,a hybrid genetic bat algorithm（ HGBA） is proposed for flexible job shop scheduling problem（ FJSP） with minimizing makespan criteria. In order to improve the quality and diversity of the initial population,the initial population is generated by combining the three methods. In this paper,the inertia weight is redefined to balance local search with global search. Then based on the mutation operator of genetic algorithm,a neighborhood search of the mutation operator is proposed for shortcoming of the local optimal solution. At the same time,according to the coding method and the ineffective solution caused by updating the location,a hybrid column crossover method is proposed to update the location inspired by the crossover operator of genetic algorithm. Finally,the performance of the algorithm is tested by three examples. The experimental results verify the effectiveness of the proposed algorithm in solving the FJSP.
作者
徐华
程冰
XU Hua;CHENG Bing(School of Intemet of Things Engineering,Jiangnan University,Wuxi 214122 ,China)
出处
《小型微型计算机系统》
CSCD
北大核心
2018年第5期1010-1015,共6页
Journal of Chinese Computer Systems
基金
江苏省自然科学基金项目(BK20140165)资助
国家留学基金委赞助项目(201308320030)资助
关键词
柔性作业车间调度
混合遗传蝙蝠算法
邻域搜索
混合列交叉
flexible job shop schextuling
hybdd genetic bat algorithm
neighborhood search
hybrid column crossover
