改进多邻域候鸟优化算法的柔性作业车间调度研究  

Research on flexible job shop scheduling based on improved multi-neighborhood migratory bird optimization algorithm

作　　者：杜凌浩 向凤红[1] DU Linghao;XIANG Fenghong(Faculty of Information Engineering and Automation,Kunming University of Science and Technology,Kunming 650500,China)

机构地区：[1]昆明理工大学信息工程与自动化学院,昆明650500

出　　处：《兵器装备工程学报》2022年第12期299-306,共8页Journal of Ordnance Equipment Engineering

基　　金：国家自然科学基金项目(61163051);云南省重大科技专项计划项目(202002AC080001)。

摘　　要：针对最小化最大完工时间的柔性作业车间调度问题(FJSP),提出一种改进的多邻域候鸟优化算法。首先,采用随机和最优加工时间策略提高初始种群质量;其次,采用两段式编码解决FJSP的机器选择和工序排序问题,基于不同的插入和变异算子设计了6种邻域结构,采用联合邻域搜索策略扩大解空间的搜索范围;再次,采用二次种内竞争策略以增强优秀个体在种群中的作用,设计了种间协同策略来避免算法陷入局部最优。最后,通过实例和基准算例验证了所提算法在求解FJSP问题时的有效性。An improved multi-neighborhood migratory bird optimization algorithm is proposed for the Flexible Job Shop Scheduling Problem(FJSP) that minimizes makespan. Firstly, random and optimal processing time strategies are used to improve the quality of initial population;secondly, two-step coding is used for machine selection and process sequencing of FJSP. Six neighborhood structures are designed by means of different insertion and variation operators, and the joint neighborhood search strategy is used to enlarge the search scope of solution space. Then, the second intra-species competition strategy is adopted to enhance the role of excellent individuals in the population, and an interspecific cooperative strategy is designed to avoid the local optimal problem. Finally, the effectiveness of the proposed algorithm in solving FJSP problems is verified by empirical evidence and benchmark examples.

关 键 词：柔性作业车间调度 多邻域结构 联合邻域搜索策略 二次种内竞争 种间协同策略 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]