离散花朵授粉算法求解多目标柔性车间调度

Discrete flower pollination algorithm for solving multi-objective flexible job shop scheduling problem

为了优化调度方案,针对多目标柔性车间调度问题的特性,以最大完工时间、生产成本、能源消耗和加工质量为优化目标,提出一种离散花朵授粉算法。算法采用轮盘赌均值派选策略生成初始种群,并采用机器序列算法计算编码的目标值;为了优化算法的寻优能力,重新定义了花朵授粉算法中的两种授粉方式。最后通过基准算例和实际生产数据实验证明了所提算法的有效性。

To optimize the scheduling scheme,aiming at the features of multi-objective flexible job shop scheduling problem,a discrete flower pollination algorithm was proposed by taking maximum completion time,production cost,energy consumption and processing quality as the optimization objectives.A roulette mean distribution rule was designed to generate initial population,and uses the machine sequence algorithm was used to calculate the encoded target value.To optimize the algorithm s optimization ability,the two pollination methods in the flower pollination algorithm were redefined.The benchmark study and actual production data experiments were carried out.The results showed that the proposed algorithm could solve the multi-objective shop scheduling problem.