基于改进的NSGA-II纺织生产车间柔性作业车间调度问题算法的研究  

Research on Improved NSGA-II for Flexible Job Shop Scheduling Problems in Textile Workshop

作　　者：贾坤 汪治学 陈瀚宁 Jia Kun;Wang Zhixue;Chen Hanning(Jingwei Textile Machinery Company Limited,Beijing 100176,China;School of Control Science and Engineering,Tiangong University,Tianjin 300380,China;School of Computer Science and Technology,Tiangong University,Tianjin 300380,China;Engineering Research Center of Integration and Application of Digital Learning Technology,Ministry of Education,Beijing 100039,China)

机构地区：[1]经纬纺织机械股份有限公司,北京100176 [2]天津工业大学控制科学与工程学院,天津300380 [3]天津工业大学计算机科学与技术学院,天津300380 [4]数字化学习技术集成与应用教育部工程研究中心,北京100039

出　　处：《新型工业化》2024年第5期85-95,共11页The Journal of New Industrialization

基　　金：数字化学习技术集成与应用教育部工程研究中心创新基金项目“基于人工智能的数字化教育资源开发、利用、管理与评价技术研究”(项目编号1221003)。

摘　　要：在纺织生产线调度领域,传统的人工调度方式已难以满足当前对高效利用机器和提升生产效率的迫切需求。鉴于此,本文建立了以最小化最大完工时间和机器总负载为优化目标的多目标柔性作业车间调度问题(flexible job shop scheduling problem,FJSP)数学模型,并提出了一种改进的NSGA-II算法(INSGA-II)用于求解。本文的主要特点是:(1)该算法采用基于工序和机器的两层编码方法;(2)采用混合种群初始化策略,目的是提高种群的初始质量;(3)设计了一种基于迭代次数的变领域搜索策略,在减少无效搜索的同时提高了局部搜索能力。本文在MK01-MK09和abz05-abz09的测试集上,将所提出的算法与其他算法(MOEA/D、MOEA/DD和NSGA-II)进行对比,并通过对14个标准算例的分析,证明了改进个NSGA-II算法在求解FJSP问题中的有效性。In the textile production scheduling field,the traditional manual scheduling approach has been difficult to meet the current urgent requirements for the efficient use of machines and improve production efficiency.This paper develops a multi-objective mathematical model of the flexible job shop scheduling problem(FJSP)with the optimization objectives of maximum completion time and minimum total machine load.And an improved NSGA-II algorithm(INSGA-II)is proposed to solve the problem.The main innovations of this paper are as follows:First,a two-layer operation-and machine-based coding approach is used in INSGA-II.Second,a hybrid population initialization strategy is adopted to improve the initial quality of the population.Third,a variable neighborhood search strategy based on the number of iterations is designed to improve the local search capability while reducing the invalid search.Finally,the proposed algorithm is compared with other algorithms(MOEA/D,MOEA/DD,and NSGA-II)on the test sets MK01-MK09 and abz05-abz09.The effectiveness of the INSGA-II solving the FJSP is demonstrated by experimental results.

关 键 词：柔性作业车间调度问题 多目标优化算法 变领域搜索策略 混合种群初始化策略 

分 类 号：TP278[自动化与计算机技术—检测技术与自动化装置]