Improved Adaptive Non-Dominated Sorting Genetic Algorithm With Elite Strategy for Solving Multi-Objective Flexible Job-Shop Scheduling Problem

IEEE Access

Xu Liang¹  Xiaolin Gu²  Ming Huang²  Jiabao Chen² 

[1] Computer School, Beijing Information Science and Technology University, Beijing, China;Software Technology Institute, Dalian Jiaotong University, Dalian, China;

关键词: Non-dominated sorting;    genetic algorithm;    adaptive;    job-shop scheduling;   

DOI  :  10.1109/ACCESS.2021.3098823

来源: DOAJ

【 摘 要 】

Regarding the complicated flexible job-shop scheduling problem, it is not only required to get optimal solution of the problem but also required to ensure low-carbon and environmental protection. Based on the NSGA-II algorithm, this article proposes an improved adaptive non-dominated sorting genetic algorithm with elite strategy (IA-NSGA-ES). Firstly, the constructive heuristic algorithm is introduced in the initial population phase, and the weight aggregation method is used to restrain the multi-objective mathematical model which takes total completion time, carbon emission and maximum machine tools load as objectives; secondly, elite strategy is improved, simulated annealing method is used to replace parent generation by child generation to enhance the replaced population quality. The improved algorithm obtains the Pareto optimal solution set faster. Using standard computation example and practical workshop problem for simulation, the results of simulation prove that the algorithm is effective and feasible.

【 授权许可】

Unknown