###
计算机系统应用英文版:2020,29(11):218-226
本文二维码信息
码上扫一扫!
基于Q学习算法的作业车间动态调度
(上海理工大学 管理学院, 上海 200093)
Job Shop Dynamic Scheduling Based on Q-Learning Algorithm
(College of management, University of Shanghai for Science and Technology, Shanghai 200093, China)
摘要
图/表
参考文献
相似文献
本文已被:浏览 869次   下载 1891
Received:December 15, 2019    Revised:January 21, 2020
中文摘要: 近年来, 在基于Q学习算法的作业车间动态调度系统中, 状态-行动和奖励值靠人为主观设定, 导致学习效果不理想, 与已知最优解相比, 结果偏差较大. 为此, 基于作业车间调度问题的特质, 对Q学习算法的要素进行重新设计, 并用标准算例库进行仿真测试. 将结果先与已知最优解和混合灰狼优化算法、离散布谷鸟算法和量子鲸鱼群算法在近似程度、最小值方面进行比较分析. 实验结果表明, 与国内求解作业车间调度问题的Q学习算法相比, 该方法在最优解的近似程度上显著提升, 与群智能算法相比, 在大多数算例中, 寻优能力方面有显著提升.
Abstract:In recent years, in the job shop dynamic scheduling system based on Q-learning algorithm, the state action and reward value are set subjectively by human beings, which leads to the unsatisfactory learning effect. Compared with the known optimal solution, the result deviation is larger. For this reason, based on the characteristics of job shop scheduling problem, the elements of Q-learning algorithm are redesigned, and simulation test is carried out with standard case library. The results are compared with the known optimal solution, the hybrid Gray Wolf algorithm, the discrete cuckoo algorithm and the quantum whale swarm algorithm in terms of approximation and minimum. The experimental results show that compared with the Q-learning algorithm for solving the job shop scheduling problem in China, this method is significantly improved in the approximate degree of the optimal solution, and compared with the group intelligence algorithm, in most cases, the optimization ability is significantly improved.
文章编号:     中图分类号:    文献标志码:
基金项目:国家自然科学基金(71840003); 上海理工大学科技发展基金(2018KJFZ043)
引用文本:
王维祺,叶春明,谭晓军.基于Q学习算法的作业车间动态调度.计算机系统应用,2020,29(11):218-226
WANG Wei-Qi,YE Chun-Ming,TAN Xiao-Jun.Job Shop Dynamic Scheduling Based on Q-Learning Algorithm.COMPUTER SYSTEMS APPLICATIONS,2020,29(11):218-226