摘要
采用人工蜂群算法对工件尺寸有差异的单机批调度问题的制造跨度进行优化的提出,是针对问题的离散优化特征,采用遗传算法中的变异操作方法产生蜂群路径的邻域解。在解码时采用Batch First Fit算法,将蜂群的路径转化为可行的批调度方案,来获得制造跨度,仿真实验中对问题的各种不同复杂度的随机算例均进行了编程实现,结果表明人工蜂群算法在求解该问题时是有效的。
Research on artificial bee colony algorithm （ABC） for minimize the makespan on a single batch-processing machine with non-identical job sizes. For the discrete optimization problem, the mutation operation of genetic algorithm is taken to produce the neighborhood of the paths for the bee colony. In the decoding, batch first fit heuristic is taken to transform the paths of artificial bees into solutions of the problem and get the makespan. In the experiment, all levels of random instances are simulated and the results show the efficiency of the algorithm.
出处
《四川大学学报（自然科学版）》
CAS
CSCD
北大核心
2009年第3期657-662,共6页
Journal of Sichuan University(Natural Science Edition)
基金
国家自然科学基金(70671096)
关键词
生产调度
批处理机
不同尺寸工件
人工蜂群算法
组合优化
scheduling, batch-processing machine, non-identical job sizes, combinatorial optimization
