摘要
文章针对分布式装配置换流水车间调度问题,提出一种离散人工蜂群算法,以最小化最大完工时间。首先,提出一种基于随机产品与工件顺序的初始解生成方法。然后,设计一种基于关键路径的种群个体领域搜索策略,并结合锦标赛选择与新型精英保留策略,以达到加速种群收敛的目的。最后,通过变换陷入局部陷阱的种群个体,实现挖掘与探索能力的平衡。研究中基于1710个算例,进行了大量的计算实验,计算结果验证了所提算法的优越性。
For the distributed assembly permutation flow shop scheduling problem,a discrete artificial bee colony algorithm is proposed to minimize the makespan.Firstly,an initial solution generation method based on random product order and workpiece order is proposed.Secondly,an population individual neighborhood search strategy based on the critical path is designed,and tournament selection and novel elite retention strategy are employed to accelerate population convergence.Finally,the balance of exploitation and exploration capability is achieved by transforming the population individuals caught in local traps.A large number of computational experiments based on 1710 instances are carried out.The results verify the superiority of the proposed algorithm.
作者
段秀山
DUAN Xiushan(College of Mechanical Engineering,Chongqing University of Technology,Chongqing 400054,China)
出处
《现代信息科技》
2021年第24期124-129,共6页
Modern Information Technology
