期刊
NEURAL COMPUTING & APPLICATIONS
卷 34, 期 24, 页码 22303-22330出版社
SPRINGER LONDON LTD
DOI: 10.1007/s00521-022-07714-3
关键词
Memetic algorithm; Multi-objective; Energy-efficient distributed flexible flow shop scheduling; Multiple neighborhoods
资金
- National Natural Science Foundation of China [62103195, 62003203]
- China Postdoctoral Science Foundation [2021M701700]
- Jiangsu Natural Science Foundation, China [BK20210558]
- Youth Talent Support Program of Association for Science and Technology in Xi'an, China [095920211321]
- Research Startup Fund of Shaanxi Normal University and Nanjing Normal University, China
This paper proposes a multi-objective memetic algorithm with a two-level encoding scheme to solve the energy-efficient distributed flexible flow shop scheduling problem. Through comprehensive experiments, the effectiveness of the algorithm in optimizing total weighted tardiness and energy consumption is verified.
This paper focuses on an energy-efficient distributed flexible flow shop scheduling problem (EEDFFSP) with variable machine speed. The EEDFFSP needs to solve four sub-problems: factory assignment, determination of the job sequence at each stage, machine selection, and the speed selection for each job on a machine. A multi-neighborhood-based multi-objective memetic algorithm (MMMA) is proposed to optimize total weighted tardiness and energy consumption. The MMMA employs a two-level encoding scheme including a job permutation and a speed matrix. A highly-efficient decoding strategy is utilized to reduce the search space of the sub-problems. In the initial phase, a weighted NEH (Nawaz-Enscore-Ham) based-initial method is developed to generate an initial population. Two genetic global search operators are designed to perform exploration evolution. Then, several multiple neighborhoods including several permutation adjustment operations within or between factories, an energy-saving strategy, and a speed adjustment strategy are integrated to enhance exploitation ability. The comprehensive experiments on extensive instances are performed to test the contribution of the main components and the performance of the MMMA. The average values of Hypervolume and Unary Epsilon indicators obtained by the variants of the MMMA without the initialization method, genetic global search, local search, and energy-saving strategy are worse than the complete MMMA, which demonstrates a significant contribution of these components to the MMMA. The MMMA obtains the best values of indicators among all the compared algorithms within a limited run time, which demonstrates the MMMA is an effective and efficient algorithm for solving the EEDFFSP.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据