基于混合离散人工蜂群算法的阻塞Flow Shop调度

A Hybrid Discrete Artificial Bee Colony Algorithm for the Flow Shop Scheduling Problem with Blocking

针对带阻塞的Flow Shop调度问题,以最小化总流水时间为调度目标,提出了一种混合离散人工蜂群(Hybrid Discrete Artificial Bee Colony,HDABC)算法。HDABC算法采用基于NEH和NEH变体初始化,保证种群的质量和多样性。在雇佣蜂阶段采用差分进化策略产生邻域个体;在跟随蜂阶段采用锦标赛选择方法选择个体跟随,并对选择的个体采用优化插入操作产生新的邻域个体。此外,在侦查蜂阶段再一次采用锦标赛选择方法选择个体,并对较好的个体执行破坏重建操作,用产生的新个体代替原来较差的个体。用正交设计方法调节了该算法的参数。通过与其他两个算法的仿真实验结果比较,验证了本文算法的优越性。

In this paper, a hybrid discrete artificial bee colony algorithm （HDABC） is proposed for blocking flow shop scheduling problem via minimizing the total flow time, To guarantee the quality and diversity, NEH and the improved NEH are employed to initialize the population in HDABC algorithm. In the employed bees phase, the differential evolution strategy is used to generate the neiborhood individual. In onlooker bees phase, the tournament selection is used to select the onlooker individual which are optimized via insert operator to produce the new neighborhood individual. Besides, the tournameflt selection is again adopted to select the individual in the scout bees phase. Moreover, the destruction and construction are made on the better individuals, whose result replaces the worse individual. Finally, an orthogonal experiment design is performed to set HDABC^s parameters. The simulation results indicate the superiority of the proposed HDABC scheduling algorithm.