机电工程技术2024，Vol.53Issue(5)：11-15,85,6.DOI:10.3969/j.issn.1009-9492.2024.05.003
基于NSGA-Ⅲ算法求解柔性作业车间调度问题
Solving Flexible Job Shop Scheduling Problem Based on NSGA-Ⅲ Algorithm
摘要
Abstract
An improved NSGA-Ⅲ algorithm is proposed for multi-objective flexible job shop scheduling problems,with completion time,total machine load,and bottleneck machine load as the objectives to establish a scheduling model.Firstly,to improve the diversity of the population,a penalty based boundary intersection distance is considered to define the distance between the individual population and the reference vector in association operations;secondly,in order to improve the computational efficiency of environmental selection,a penalty based boundary intersection distance elimination mechanism is used to protect individuals,reducing the computational cost of individual protection strategies;compared with the NSGA-Ⅲ algorithm using two evaluation indicators,its convergence and diversity are both due to the NSGA-Ⅲ algorithm.At the same time,the improved NSGA-Ⅲ algorithm is tested on four Kacem examples and found to have higher quality solutions.Finally,practical production examples are used to prove that the improved NSGA-Ⅲ algorithm is superior to or equivalent to existing methods,and the operability of this method in solving multi-objective flexible job shop scheduling problems is also demonstrated.关键词
多目标柔性作业车间/NSGA-Ⅲ/变异策略/消除机制Key words
multi-objective flexible job shop/NSGA-Ⅲ/adaptive mutation strategy/elimination mechanism分类
信息技术与安全科学引用本文复制引用
宋存利,朱建伟,李金泰..基于NSGA-Ⅲ算法求解柔性作业车间调度问题[J].机电工程技术,2024,53(5):11-15,85,6.基金项目
辽宁省教育厅科学研究计划资助项目(LJKZ0489) （LJKZ0489）
