一个分离人工的蜜蜂殖民地算法为解决与全部的流动时间标准安排问题的堵住的流动商店被建议。第一,在算法的答案作为工作排列被代表。第二,一个初始化计划基于 NEH (Nawaz-Enscore-Ham ) 的变体启发式并且本地搜索被设计与质量和差异构造起始的人口。基于重申的贪婪算法的想法,第三,一些最新设计了计划因为采用的蜜蜂,旁观者蜜蜂和侦察蜜蜂被介绍。建议算法的表演在著名 Taillard 基准集合上被测试,并且计算结果表明分离人工的蜜蜂殖民地算法的有效性。另外,基准集合的最好已知的答案被为与全部的流动时间标准安排问题的堵住的流动商店提供。
A discrete artificial bee colony algorithm is proposed for solving the blocking flow shop scheduling problem with total flow time criterion. Firstly, the solution in the algorithm is represented as job permutation. Secondly, an initialization scheme based on a variant of the NEH (Nawaz-Enscore-Ham) heuristic and a local search is designed to construct the initial population with both quality and diversity. Thirdly, based on the idea of iterated greedy algorithm, some newly designed schemes for employed bee, onlooker bee and scout bee are presented. The performance of the proposed algorithm is tested on the well-known Taillard benchmark set, and the computational results demonstrate the effectiveness of the discrete artificial bee colony algorithm. In addition, the best known solutions of the benchmark set are provided for the blocking flow shop scheduling problem with total flow time criterion.