论文部分内容阅读
针对以最小化最大完成时间为调度目标的置换流水车间调度问题,提出了混合离散人工蜂群算法.初始化种群采用NEH和随机方法.在算法的雇佣蜂阶段和侦查蜂阶段分别采用离散差分进化策略和变邻域搜索的变体产生邻域个体,为了兼顾算法的全局搜索和局部搜索能力,雇佣蜂阶段接受新个体采用模拟退火的概率突跳机制,而选择利用锦标赛方法,并对跟随的个体按一定概率进行局部搜索.此外,在侦查蜂阶段对锦标赛选择的个体执行破坏重建操作,用新产生的个体代替较差的个体.利用正交实验法调节算法参数,通过与其他算法的仿真实验结果比较,验证了算法的有效性.
In order to solve the problem of permutation flow shop scheduling with minimized maximum completion time, a hybrid discrete artificial bee colony algorithm is proposed, which uses NEH and stochastic methods to initialize the population.The discrete-difference evolutionary strategy In order to take into account the global search and local search ability of the algorithm, the employment bees stage accepts the probabilistic sudden jump mechanism of simulated annealing by the new individual, and selects to utilize the tournament method, According to a certain probability of local search.In addition, during the investigation bee stage of the championship selected individuals to perform reconstruction operations, with the new generation of individuals to replace the poor individuals.Using orthogonal experimental method to adjust the parameters of the algorithm through the simulation with other algorithms The results show that the algorithm is effective.