一种改进离散磷虾群的复杂产品装配调度算法  

An Improved Discrete Krill Herd Algorithm for Complex Product Assembly Scheduling Problem

作　　者：庄存波[1] 熊辉[1] 刘检华[1] 唐承统[1] ZHUANG Cun-bo;XIONG Hui;LIU Jian-hua;TANG Cheng-tong(School of Mechanical Engineering,Beijing Institute of Technology-,Beijing 100081,China)

机构地区：[1]北京理工大学机械与车辆学院,北京100081

出　　处：《兵工学报》2018年第8期1590-1600,共11页Acta Armamentarii

基　　金：国家国防科技工业局基础科研项目(JCKY2016204A502;JCKY2016203B106)

摘　　要：针对复杂产品装配车间调度问题,提出了一种改进的离散磷虾群(IDKH)装配调度算法。以工期最小化为调度目标,通过分析复杂产品装配工艺流程特点,建立了复杂产品装配调度模型。基于排列的编码方式和启发式规则的改进解码方式实现了调度解与种群个体之间的转换,并通过局部搜索和重启操作对标准磷虾群(KH)算法进行了改进,增强了算法的局部开采能力和全局搜索能力。采用正交试验方法分析了不同参数设置对算法性能的影响,确定了IDKH算法的最佳参数组合。基于标准实例对不同算法性能进行了比较,对比结果表明,IDKH装配调度算法在求解质量和稳定性上均优于遗传算法、分布估计算法、引力搜索算法和标准KH算法。An improved discrete krill herd（ IDKH） algorithm is proposed for the complex product assembly scheduling problem. The objective is to minimize the makespan. An assembly scheduling model is established by analyzing the characteristics of a complex product process flow. The transformation between scheduling solution and population individual is realized by using permutation-based coding and heuristicbased decoding methods. A local search and a restart operation procedure are presented to improve the exploitation and global exploration ability of basic krill herd（ KH）. The parameters of the proposed IDKH are calibrated by using a design of experimental approach. And a comparative evaluation is conducted with the well-known algorithms. The results show that the proposed IDKH has advantage over genetic algorithm,estimation of distribution algorithm,gravitational search algorithm,and basic KH in terms of quality and stability.

关 键 词：磷虾群算法 装配调度 复杂产品 混合流水车间调度 

分 类 号：TB497[一般工业技术]