面向柔性作业车间调度的变邻域搜索候鸟优化算法  

Migrating Birds Optimization Algorithm Used Variable Neighborhood Search for Flexible Job Shop Scheduling

作　　者：朱颢东[1,2] 何保锋[1] 

机构地区：[1]郑州大学西亚斯国际学院计算机科学系,河南新郑451150 [2]郑州轻工业学院计算机与通信工程学院,河南郑州450002

出　　处：《微电子学与计算机》2017年第4期28-32,38,共6页Microelectronics & Computer

摘　　要：分析柔性作业车间的生产特点,结合候鸟优化算法和变邻域搜索算法,提出了一种变邻域搜索候鸟优化算法(Migrating Birds Optimization Algorithm Used Variable Neighborhood Search,VNS_MBOA)求解该车间内的生产调度问题.该算法采用分段式编码方式,并分两阶段对算法种群进行初始化,以提高初始解的质量.根据问题的特性,设计了两种邻域结构,并引入一种变邻域搜索算法有效加强了VNS_MBOA的搜索能力.使用基准算例对本文算法进行测试,并将计算结果与其他文献中算法结果进行比较.仿真数据表明本文所提出的算法在解决柔性作业车间调度方面具有一定的有效性.By analyzing the production features of the flexible job shop,a migrating birds optimization algorithm used variable neighborhood search（VNS_MBOA）was proposed by combining the migrating birds optimization and the variable neighborhood search algorithm to solve the production scheduling problem.A segment-based encoding approach is adopted,and a two-phase initialization of the population in the algorithm is performed to improve the quality of the initial solution.On the basis of the characteristics of the problem,two neighborhood structures are designed,based on which a variable neighborhood search algorithm is introduced to enhance the searching capability of VNS_MBOA effectively.Benchmark instances are adopted to test the proposed algorithm,and the simulation results are compared with other algorithms in literature.The computational data demonstrate that the proposed algorithm has certain degree effect for solving the flexible job shop scheduling problem.

关 键 词：柔性作业车间 生产调度 候鸟优化算法 变邻域搜索 

分 类 号：TH165[机械工程—机械制造及自动化]