An improved simulated annealing algorithm based on residual network for permutation flow shop scheduling

• Published in: Complex & intelligent systems Vol. 7; no. 3; pp. 1173 - 1183
• Main Authors: Li, Yang, Wang, Cuiyu, Gao, Liang, Song, Yiguo, Li, Xinyu
• Format: Journal Article
• Language: English
• Published: Cham Springer International Publishing 01.06.2021; Springer Nature B.V
• Subjects: Algorithms; Attenuation; Benchmarks; Complexity; Computational Intelligence; Data Structures and Information Theory; Design parameters; Engineering; Feature extraction; Job shop scheduling; Job shops; Original Article; Parameter modification; Permutations; Scheduling; Simulated annealing; Residual networks; Improved simulated annealing algorithm; Permutation flow shop scheduling; TA benchmark
• ISSN: 2199-4536; 2198-6053; 2198-6053
• DOI: 10.1007/s40747-020-00205-9

The permutation flow shop scheduling problem (PFSP), which is one of the most important scheduling types, is widespread in the modern industries. With the increase of scheduling scale, the difficulty and computation time of solving the problem will increase exponentially. Adding the knowledge to intelligent algorithms is a good way to solve the complex and difficult scheduling problems in reasonable time. To deal with the complex PFSPs, this paper proposes an improved simulated annealing (SA) algorithm based on residual network (SARes). First, this paper defines the neighborhood of the PFSP and divides its key blocks. Second, the Residual Network (ResNet) is used to extract and train the features of key blocks. And, the trained parameters are stored in the SA algorithm to improve its performance. Afterwards, some key operators, including the initial temperature setting and temperature attenuation function of SA algorithm, are also modified. After every new solution is generated, the parameters trained by the ResNet are used for fast ergodic search until the local optimal solution found in the current neighborhood. Finally, the most famous benchmarks including part of TA benchmark are selected to verify the performance of the proposed SARes algorithm, and the comparisons with the-state-of-art methods are also conducted. The experimental results show that the proposed method has achieved good results by comparing with other algorithms. This paper also conducts experiments on network structure design, algorithm parameter selection, CPU time and other problems, and verifies the advantages of SARes algorithm from the aspects of stability and efficiency.