华侨大学学报（自然科学版）2025，Vol.46Issue(5)：551-560,10.DOI:10.11830/ISSN.1000-5013.202508028
改进的NSGA-Ⅱ算法求解绿色柔性作业车间调度问题
Improved NSGA-Ⅱ Algorithm for Solving Green Flexible Job-Shop Scheduling Problem
摘要
Abstract
For the green flexible job-shop scheduling problem,a multi-objective scheduling optimization model is established with the optimization objectives of minimizing the makespan and total energy consumption.An improved non-dominated sorting genetic algorithm(INSGA-Ⅱ)is proposed to solve the model.First,a hybrid initialisation strategy is adopted to generate a high-quality and diverse initial population.Second,adaptive crossover and mutation probabilities,together with an improved elite selection strategy,are introduced to a-void premature convergence.Then,an enhanced variable neighbourhood search strategy is developed to en-hance the local search accuracy.Finally,the proposed INSGA-Ⅱ is compared with NSGA-Ⅱ,NSGA-Ⅲ,and SPEA2 on 14 standard test cases from the Brandimarte and Hurink datasets.Experimental results show that INSGA-Ⅱ demonstrates significant advantages in the convergence and diversity of the solution set,and can ef-fectively solve the green flexible job-shop scheduling problem,providing a novel solution for green manufactur-ing.关键词
绿色柔性作业车间调度问题/NSGA-Ⅱ/多目标优化/变邻域搜索Key words
green flexible job-shop scheduling problem/NSGA-Ⅱ/multi-objective optimization/variable neighborhood search分类
机械工程引用本文复制引用
陈心文,温廷羲,傅玉青,许剑飞..改进的NSGA-Ⅱ算法求解绿色柔性作业车间调度问题[J].华侨大学学报（自然科学版）,2025,46(5):551-560,10.基金项目
福建省泉州市科技计划项目(2024QZC010R,2024G11) （2024QZC010R,2024G11）
