【摘要】 针对柔性作业车间调度问题(Flexible Job shop Scheduling Problem, FJSP),以优化最大完工时间为目标，提出了一种改进蛇优化(Improved Snake Optimization, ISO)算法。该算法对蛇优化算法进行研究，使用两段式编码替代原算法的实数编码，使得改进后的蛇优化算法可以在离散空间中对蛇个体的位置进行更新。此外，针对原算法中初始种群质量较低的问题，采用GLR策略平衡机器加工负荷，以提高算法的初始化质量。并针对原算法中蛇个体的位置变化与交互机制，在保留原有蛇群演化的基础上使用2个操作算子对其进行重新设计。最后，使用正交实验分析算法参数，并对车间的15个基准算例和1个案例进行仿真和对比，验证了所提算法求解该问题的有效性和稳定性。更多还原

【Abstract】 Aiming at optimizing the maximum completion time for Flexible Job Shop Scheduling Problem(FJSP), it proposes an Improved Snake Optimization(ISO) algorithm. This algorithm studies the snake optimization algorithm and uses two-stage coding to replace the real coding of the original algorithm, so that the improved snake optimization algorithm can update the position of the individual snake in the discrete space. In addition, to solve the problem of low initial population quality in the original algorithm, GLR strategy is used to balance the machining load to improve the initialization quality of the algorithm. The position change and interaction mechanism of individual snake in the original algorithm are redesigned by using two operators on the basis of preserving the evolution of the original snake group. Finally, the orthogonal experiment is used to analyze the algorithm parameters, and 15 benchmark examples and 1 case in the workshop are simulated and compared to verify the effectiveness and stability of the proposed algorithm to solve the problem.更多还原