分布式装配阻塞流水车间调度算法研究

Study on distributed assembly blocking flow shop scheduling algorithm

针对以装配完成时间为优化目标的分布式装配阻塞流水车间调度问题(DABFSP),提出一种协同帝王蝶优化(CMBO)算法.在算法的初始化阶段,CMBO有效利用分布式装配阻塞流水车间调度问题的特征,采用构造式的方法产生可行调度序列,并作为算法的初始解;在迭代过程中,CMBO利用两种协同的离散化算子更新种群;在局部搜索阶段,CMBO利用最优解的邻域信息进一步提升解的精度与质量.在以不同工件数、机器数、工厂数和产品数为组合的900个问题实例中,测试和比较了CMBO算法及其他先进对比算法的性能.实验结果及统计学分析表明:CMBO算法在求解分布式装配阻塞流水车间调度问题时优于其他两种对比算法.

A cooperative monarch butterfly optimization(CMBO)algorithm was proposed to solve the distributed assembly blocking flow shop scheduling problem(DABFSP)with the optimization objective of minimizing the assembly completion time.In the initialization stage of the algorithm,the characteristics of DABFSP were effectively utilized by CMBO,and a constructive method was proposed to generate a feasible scheduling sequence as the initial solution of the algorithm.In the iteration process,two kinds of coordinated discretization operator were employed to update the population.In the local search stage,the neighborhood information of the optimal solution was utilized to further improve the accuracy and quality of solutions.In 900 instances with different numbers of jobs,machines,factories and products,the performance of CMBO and other advanced comparison algorithms was tested and compared.Experimental results and statistical analysis show that the CMBO algorithm is superior to the other two comparison algorithms in solving the DABFSP.