求解作业车间调度问题的混合帝国主义竞争算法

发布时间：2018-04-04 16:55

本文选题：Job　切入点：Shop调度问题　出处：《计算机应用》2017年02期

【摘要】：针对最小化最大完工时间的作业车间调度问题(JSP),提出一种结合帝国主义竞争算法(ICA)和禁忌搜索(TS)算法的混合算法。混合算法以帝国主义竞争算法为基础,在同化操作中融入遗传算法中的杂交算子和变异算子,使算法全局搜索能力更强。为了克服帝国主义竞争算法局部搜索能力弱的缺点,引入禁忌搜索算法进一步优化同化操作后的后代。禁忌搜索算法采用混合邻域结构和新型选择策略,使得算法能够更有效地搜索邻域解。混合算法兼具全局搜索能力和局部搜索能力,通过对13个经典的Benchmark调度问题进行仿真测试,并与近年4种新型混合算法进行对比分析,实验结果表明了所提算法求解Job Shop调度问题的有效性和稳定性。
[Abstract]:Aiming at the Job-shop scheduling problem which minimizes the maximum completion time, a hybrid algorithm combining the imperialist competition algorithm (ICA) and Tabu search (TS) algorithm is proposed.The hybrid algorithm is based on the imperialist competition algorithm and integrates the hybrid operator and mutation operator in the assimilation operation, which makes the global search ability of the algorithm more powerful.In order to overcome the weakness of local search ability of imperialist competitive algorithm, Tabu search algorithm is introduced to further optimize the offspring of assimilation operation.The Tabu search algorithm uses a hybrid neighborhood structure and a new selection strategy, which enables the algorithm to search the neighborhood solution more effectively.The hybrid algorithm has both global search ability and local search ability. The 13 classical Benchmark scheduling problems are simulated and tested, and compared with four new hybrid algorithms in recent years.Experimental results show that the proposed algorithm is effective and stable in solving Job Shop scheduling problem.
【作者单位】：云南大学软件学院;云南省软件工程重点实验室(云南大学);
【基金】：国家自然科学基金资助项目(61462095) 云南省软件工程重点实验室开放基金资助项目(2015SE103)~~
【分类号】：TB497;TP18

【相似文献】