A discrete animal migration algorithm for dual-resource constrained energy-saving flexible job shop scheduling problem

• Published in: Journal of intelligent & fuzzy systems Vol. 42; no. 4; pp. 3431 - 3444
• Main Authors: Jiang, Tianhua, Zhu, Huiqi, Gu, Jiuchun, Liu, Lu, Song, Haicao
• Format: Journal Article
• Language: English
• Published: Amsterdam IOS Press BV 04.03.2022
• Subjects: Algorithms; Animal migration; Design of experiments; Dispatching rules; Energy consumption; Heuristic methods; Job shop scheduling; Job shops; Optimization; Permutations; Scheduling; Taguchi methods
• ISSN: 1064-1246; 1875-8967
• DOI: 10.3233/JIFS-211399

This paper presents a discrete animal migration optimization (DAMO) to solve the dual-resource constrained energy-saving flexible job shop scheduling problem (DRCESFJSP), with the aim of minimizing the total energy consumption in the workshop. A job-resource-based two-vector encoding method is designed to represent the scheduling solution, and an energy-saving decoding approach is given based on the left-shift rule. To ensure the quality and diversity of initial scheduling solutions, a heuristic approach is employed for the resource assignment, and some dispatching rules are applied to acquire the operation permutation. In the proposed DAMO, based on the characteristics of the DRCESFJSP problem, the search operators of the basic AMO are discretized to adapt to the problem under study. An animal migration operator is presented based on six problem-based neighborhood structures, which dynamically changes the search scale of each animal according to its solution quality. An individual updating operator based on crossover operation is designed to obtain new individuals through the crossover operation between the current individual and the best individual or a random individual. To evaluate the performance of the proposed algorithm, the Taguchi design of experiment method is first applied to obtain the best combination of parameters. Numerical experiments are carried out based on 32 instances in the existing literature. Computational data and statistical comparisons indicate that both the left-shift decoding rule and population initialization strategy are effective in enhancing the quality of the scheduling solutions. It also demonstrate that the proposed DAMO has advantages against other compared algorithms in terms of the solving accuracy for solving the DRCESFJSP.