arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2409.18524cs.NEcs.SYeess.SY
收藏

基于自适应知识的多目标进化算法求解具有多个并行批处理阶段的混合流水车间调度问题

Adaptive Knowledge-based Multi-Objective Evolutionary Algorithm for Hybrid Flow Shop Scheduling Problems with Multiple Parallel Batch Processing Stages

Feige Liu, Xin Li, Chao Lu, Wenying Gong

AI总结:

本文研究具有并行批处理机器的混合流水车间调度问题(PBHFSP),提出基于自适应知识的多目标进化算法(AMOEA/D),通过混合初始化、关键路径邻域搜索及自适应搜索时间调整等策略,同时优化最大完工时间和总能耗,实验证明其优于现有先进算法。

摘要:

并行批处理机器在半导体制造过程中有着广泛的应用。然而,以往研究中的问题模型将并行批处理视为加工过程中的固定加工阶段。本研究推广了该问题模型,其中用户可以根据需要任意将某些阶段设置为并行批处理阶段。本文求解了具有并行批处理机器的混合流水车间调度问题(PBHFSP)。此外,设计了一种基于自适应知识的多目标进化算法(AMOEA/D),以同时优化最大完工时间和总能耗(TEC)。首先,提出了一种基于PBHFSP知识的启发式规则混合初始化策略,以生成有前景的解。其次,基于该知识建立了析取图模型,以寻找PBHFS的关键路径。然后,提出了一种基于关键路径的邻域搜索,以增强AMOEA/D的开发能力。此外,基于Q-learning和Decay Law的学习经验自适应地调整搜索时间。随后,为了增强算法的探索能力,AMOEA/D设计了一种改进的种群更新策略和权重向量更新策略。这些策略将个体与权重向量重新匹配,从而维持种群的多样性。最后,将所提出的算法与最先进的算法进行了比较。实验结果表明,AMOEA/D在求解PBHFSP方面优于对比算法。

英文摘要:

Parallel batch processing machines have extensive applications in the semiconductor manufacturing process. However, the problem models in previous studies regard parallel batch processing as a fixed processing stage in the machining process. This study generalizes the problem model, in which users can arbitrarily set certain stages as parallel batch processing stages according to their needs. A Hybrid Flow Shop Scheduling Problem with Parallel Batch Processing Machines (PBHFSP) is solved in this paper. Furthermore, an Adaptive Knowledge-based Multi-Objective Evolutionary Algorithm (AMOEA/D) is designed to simultaneously optimize both makespan and Total Energy Consumption (TEC). Firstly, a hybrid initialization strategy with heuristic rules based on knowledge of PBHFSP is proposed to generate promising solutions. Secondly, the disjunctive graph model has been established based on the knowledge to find the critical-path of PBHFS. Then, a critical-path based neighborhood search is proposed to enhance the exploitation ability of AMOEA/D. Moreover, the search time is adaptively adjusted based on learning experience from Q-learning and Decay Law. Afterward, to enhance the exploration capability of the algorithm, AMOEA/D designs an improved population updating strategy with a weight vector updating strategy. These strategies rematch individuals with weight vectors, thereby maintaining the diversity of the population. Finally, the proposed algorithm is compared with state-of-the-art algorithms. The experimental results show that the AMOEA/D is superior to the comparison algorithms in solving the PBHFSP.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑