Large-scale scheduling of weaving workshop based on NSGAII and neural network

被引:0
作者
Lei J. [1 ,2 ]
Shen C. [1 ,2 ]
Hu X. [1 ,2 ]
Ru X. [1 ,2 ]
Peng L. [1 ,2 ]
机构
[1] Faculty of Mechanical Engineering & Automation, Zhejiang Sci-Tech University, Zhejiang, Hangzhou
[2] Key Laboratory of Modern Textile Machinery & Technology of Zhejiang Province, Zhejiang Sci-Tech University, Zhejiang, Hangzhou
来源
Fangzhi Xuebao/Journal of Textile Research | 2023年 / 44卷 / 11期
关键词
intelligent scheduling; large-scale scheduling; multi-objective optimization; neural network; NSGAII; weaving workshop;
D O I
10.13475/j.fzxb.20220301801
中图分类号
学科分类号
摘要
Objective With the increase of personnel, machines and materials, the scheduling scale of weaving workshop increases exponentially. The intelligent scheduling algorithm represented by genetic algorithm is easy to fall into the local optimal solution when solving large-scale scheduling problems, and the process is slow, which is difficult to meet the actual demand. This study aims to combine the advantages of genetic algorithm and neural network to solve the problem of large-scale scheduling in weaving workshop. Method According to the characteristics of large-scale scheduling of weaving workshop, a weaving workshop scheduling model was established to minimize overdue loss, the makespan and the number of variety changes. Then, a weaving workshop scheduling algorithm NSGAII-NN125 based on NSGAII and neural network was proposed to solve the large-scale scheduling problem of weaving workshop, which consists of a scheduling module and a multi-objective optimization module. Finally, the optimization module was adopted to find the best the scheduling module according to the merits and demerits of the generation scheme, leading to the scheduling module with high quality, fast speed and reusable. Results Comparing the objectives of minimizing overdue loss, the makespan and the number of variety changes, NSGAII-NN125 offered stable performance in a series of weaving workshop scheduling, especially in large-scale scheduling with more than 300 looms and more than 2 000 weaver's beams(Tab. 3). The optimization does not fall into the trend of local optimal solution, and the solution quality is outstanding. Compared with the optimization time, NSGAII-NN125 needed to take longer time to calculate and update the eigenvalues of the neural network. The scheduling speed of NSGAII-NN125 was about 0.67 weaver's beams per second. The NN125 model set was optimized by NSGAII-NN125 according to the scheduling requirements of a weaving workshop which can be used for scheduling similar requirements. Compared with the scheduling objectives, it can be seen that the scheduling quality of the optimized NN125 model set is only slightly weaker than that of NSGAII-NN125, and the time consumption is greatly reduced because the long optimization process is eliminated. The scheduling speed is increased to 50 weaver's beams per second, which has good practical value(Tab. 4). Conclusion The NSGAII-NN125 scheduling algorithm was divided into scheduling module and optimization module in structure. The scheduling and optimization were decoupled, so that the search space of genetic algorithm was limited to a fixed number of parameters in the neural network model, which solves the problem that the GA is easy to fall into the local optimal solution or even scheduling failure due to the large solution space in the large-scale scheduling. More importantly, NSGAII-NN125 outputs the optimal NN125 model set after solving a certain problem. The network model set can be reused to avoid repeated optimization of similar problems and improve the actual scheduling speed, which has good practical value. © 2023 China Textile Engineering Society. All rights reserved.
引用
收藏
页码:208 / 215
页数:7
相关论文
共 15 条
[1]  
CHENG Yu, ZHAO Hongwei, LONG Manli, Et al., Improvement for earliest deadline first algorithm, Journal of Jilin University (Engineering Edition), 43, 5, pp. 1338-1342, (2013)
[2]  
KRITHI Ramamritham, JOHN A Stankovic, PERNGFEI Shiah, Efficient scheduling algorithms for real-time multiprocessor systems, IEEE Trans Parallel Distrib Syst, 1, 2, pp. 184-194, (1990)
[3]  
BIN Xuelian, YANG Yuhai, JIN Shiyao, A new dynamic scheduling algorithm for real-time multiprocessor systems based on grouping and properly choosing policies, Chinese Journal ol Computers, 1, pp. 81-91, (2006)
[4]  
HE Wentao, MENG Shuo, WANG Jing'an, Et al., Weaving scheduling based on an improved ant colony algorithm [J], Textile Research Journal, 91, 5, pp. 1-7, (2021)
[5]  
HUANG Xuewen, CHEN Shaofen, ZHOU Tianyu, Et al., Survey on genetic algorithms for solving flexible job-shop scheduling problem, Computer Integrated Manufacturing Systems, 28, 2, pp. 536-551, (2022)
[6]  
GU Wenbin, LI Yuxin, QIAN Yuhui, Et al., Improved particle swarm optimization algorithm with hormone modulation mechanism for solving hybrid flow-shop scheduling problem with identical parallel machine, Computer Integrated Manufacturing Systems, 27, 10, pp. 2858-2871, (2021)
[7]  
CHEN Zihao, CHEN Songhang, CHEN Hao, Large-scale FJSP based on improved multi-group NSGA-II algorithm, Transducer and Microsystem Technologies, 40, 2, pp. 51-54, (2021)
[8]  
SONG Cunli, An improved NSGAII algorithm for hybrid flow shop scheduling problem with multi-objec-tivc [J/OL], Computer Integrated Manufacturing Systems, pp. 1-19
[9]  
CHEN Ge, YANG Jiancheng, Introduction to texile machinery [M], pp. 80-82, (2011)
[10]  
SHEN Chenya, LEI Junjie, RU Xin, Et al., Multi-objective large-scale dynamic scheduling for weaving workshop based on improved NSGAII [J], Journal ol Textile Research, 43, 4, pp. 74-83, (2022)