现代制造工程Issue(7)：8-19,12.DOI:10.16731/j.cnki.1671-3133.2025.07.002
基于Dueling-DQN的协同进化算法求解绿色分布式异构柔性作业车间调度问题
Co-evolution algorithm based on Dueling-DQN for solving green distributed heterogeneous flexible job shop scheduling problem
摘要
Abstract
For the Green Distributed Heterogeneous Flexible Job Shop Scheduling Problem(GDHFJSP),a Cooperative Evolution algorithm based on Dueling-DQN(Dueling-DQNCE)is proposed.The objective is to minimize the maximum completion time and total energy consumption,selecting Pareto frontier solutions to achieve high-quality solutions.Initially,two initialization methods are introduced to effectively enhance the quality of the initial solution population.Subsequently,an activity scheduling scheme is utilized in the decoding stage to comprehensively explore the solution space and obtain high-quality solutions.Addressing the multi-objective problem,a rapid comparison method is proposed to efficiently obtain Pareto frontier solutions.Furthermore,ten knowledge-driven neighborhood search strategies are introduced,and Dueling-DQN is employed to intelligently learn and select appropriate local search strategies for each solution,accelerating population convergence.To validate the effectiveness of Dueling-DQNCE,it is compared with the state-of-the-art DQCE algorithm in 20 instances.The computational results demonstrate that Du-eling-DQNCE outperforms Co-Evolution with Deep-Q-network(DQCE)in terms of computational resources and solution quality,confirming its effectiveness and superiority.关键词
绿色分布式异构作业车间调度/协同进化/Pareto前沿解/竞争架构深度Q网络算法Key words
green heterogeneous distributed job shop scheduling/collaborative evolution/Pareto frontier solutions/Dueling-DQN分类
信息技术与安全科学引用本文复制引用
夏良才,陈仕军..基于Dueling-DQN的协同进化算法求解绿色分布式异构柔性作业车间调度问题[J].现代制造工程,2025,(7):8-19,12.基金项目
国家自然科学基金项目(71501064) （71501064）
湖北文理学院科研能力培育基金科技创新团队项目(2020kyp006) （2020kyp006）
