基于自适应克隆启发算法的作业车间调度

Job Shop Scheduling Based on Self-adaptive Clone Heuristic Algorithm

将优先权启发式算法获得的最小生产周期倒数作为抗体,采用实数编码,给出新的自适应克隆启发算法,用于求解作业车间调度问题。设计一种新的自适应克隆算子,基于抗体间距离的大小,在抗体间自适应地分配抗体激励度和抗体克隆的数量,模拟免疫系统自适应地调节抗体克隆数量的动态过程。FT10和FT06的仿真实验表明,该算法性能稳定、效果良好。

This paper uses the inverse of Makespan as antibody, which is calculated by priority heuristic algorithm. It presents a Self-adaptive Clone Heuristic Algorithm（SACHA） based on the prior algorithm to solve Job Shop scheduling problem. SACHA adapts real Code and it designs a kind of self-adaptive clone operator based on the distance between antibodies. The amounts of clone and excitation are assigned among antibodies adaptively. It simulates the dynamic process of adjusting the amount of antibody clones adaptively. Simulation tests of FT10 and FT06 show that the algorithm is stable and good.