An automatic multi-objective evolutionary algorithm for the hybrid flowshop scheduling problem with consistent sublots
作者:
Highlights:
•
摘要
Lot streaming is the most widely used technique to facilitate overlapping of successive operations. Inspired by real-world scenarios, this paper studies a multi-objective hybrid flowshop scheduling problem with consistent sublots, aiming to simultaneously optimize two conflicting objectives: the makespan and total number of sublots. Considering the setup and transportation operations, a multi-objective mixed integer programming model is developed and the trade-off between the two objectives is evaluated. Because of the NP-hard property of the addressed problem, metaheuristics are suggested. It is well known that the performance of metaheuristics is highly dependent on the setting of algorithmic parameters, referred to as numerical and categorical parameters. However, the traditional design process might be biased by previous experience. To eliminate these issues, an automated algorithm design (AAD) methodology is introduced to conceive a multi-objective evolutionary algorithm (MOEA) in a promising framework. The AAD enables designing the algorithm by automatically determining parameters and their combinations with minimal user intervention. With regard to the problem-specific characteristics and the employed algorithm framework, for the categorical parameters, including decomposition, solution encoding and decoding, solution initialization and neighborhood structures, several operators are designed specifically. Along with the numerical parameters, these categorical parameters are determined and combined using the designed iterated racing procedure. Comprehensive computational results demonstrate that the automated MOEA outperforms other state-of-the-art MOEAs for the addressed problem.
论文关键词:Hybrid flowshop scheduling,Lot streaming,Consistent sublots,Multi-objective evolutionary algorithm,Automatic algorithm design
论文评审过程:Received 29 October 2020, Revised 20 November 2021, Accepted 24 November 2021, Available online 15 December 2021, Version of Record 23 December 2021.
论文官网地址:https://doi.org/10.1016/j.knosys.2021.107819