改进麻雀搜索算法求解柔性作业车间调度问题  

An Improved Sparrow Search Algorithm for Flexible Job-shop Scheduling Problem

作　　者：武福[1] 徐上壹 Wu Fu;Xu Shangyi(School of Mechanical Engineering,Lanzhou Jiaotong University,Lanzhou 730070,China)

机构地区：[1]兰州交通大学机电工程学院,兰州730070

出　　处：《机电工程技术》2025年第3期25-29,68,共6页Mechanical & Electrical Engineering Technology

基　　金：甘肃省教育科技创新项目(2022A-036)。

摘　　要：针对以最小完工时间为目标的单目标柔性作业车间调度问题(FJSP),提出了一种改进麻雀搜索算法(ISSA)。首先,采用两段式编码将FJSP描述为机器选择和工序排序两个子问题,引入转换机制实现FJSP的离散调度解与连续麻雀个体位置向量之间的映射。然后,采用混合式种群初始化策略生成初始种群,通过黄金正弦算法改进发现者的位置更新方式,增强算法的全局搜索能力。最后,对一个应用实例以及Brandimare标准测试集中的10个FJSP算例进行仿真并与其他智能算法对比分析。结果表明,改进后的ISSA算法用于求解FJSP问题具有较好的算法收敛性,能够有效地获得FJSP问题的优化解。An improved sparrow search algorithm(ISSA)is proposed for single-objective flexible job-shop scheduling problem(FJSP)with minimum completion time as the target.Firstly,a two-stage encoding is used to describe the FJSP as two subproblems,machine selection and process sequencing,and a transformation mechanism is introduced to realize the mapping between the discrete scheduling solution of the FJSP and the position vectors of continuous individual sparrows.Then,a hybrid population initialization strategy is used to generate the initial population,and the position update method of the discoverer is improved by the golden sine algorithm to enhance the global search capability of the algorithm.Finally,an application example and 10 FJSP examples in Brandimare standard test set are simulated and compared with other intelligent algorithms.The results show that the improved ISSA algorithm has good convergence for solving FJSP problems and can effectively obtain the optimal solution of FJSP problems.

关 键 词：麻雀搜索算法 柔性作业车间调度问题 黄金正弦策略 

分 类 号：TP301[自动化与计算机技术—计算机系统结构]