现代制造工程Issue(9)：12-19,8.DOI:10.16731/j.cnki.1671-3133.2025.09.002
基于改进蛇优化算法的柔性作业车间调度研究
Research on flexible job shop scheduling based on improved snake optimization algorithm
摘要
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 algo-rithm,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 param-eters,and 15 benchmark examples and 1 case in the workshop are simulated and compared to verify the effectiveness and stabili-ty of the proposed algorithm to solve the problem.关键词
柔性作业车间调度/离散优化问题/改进蛇优化算法Key words
flexible job shop scheduling/discrete optimization problem/improved snake optimization algorithm分类
机械制造引用本文复制引用
朱敏,王岩,卞京,卢宇涵..基于改进蛇优化算法的柔性作业车间调度研究[J].现代制造工程,2025,(9):12-19,8.基金项目
国家自然科学基金项目(62073113) （62073113）
