期刊文献+

基于改进D3QN的煤炭码头卸车排产智能优化方法

Intelligent Optimization of Coal Terminal Unloading Scheduling Based on Improved D3QN Algorithm
下载PDF
导出
摘要 采用智能化决策排产能够提高大型港口的运营效率,是人工智能技术在智慧港口场景落地的重要研究方向之一。针对煤炭码头卸车智能排产任务,将其抽象为马尔可夫序列决策问题。建立了该问题的深度强化学习模型,并针对该模型中动作空间维度高且可行动作稀疏的特点,提出一种改进的D3QN算法,实现了卸车排产调度决策的智能优化。仿真结果表明,对于同一组随机任务序列,优化后的排产策略相比随机策略实现了明显的效率提升。同时,将训练好的排产策略应用于随机生成的新任务序列,可实现5%~7%的排产效率提升,表明该优化方法具有较好的泛化能力。此外,随着决策模型复杂度的提升,传统启发式优化算法面临建模困难、求解效率低等突出问题。所提算法为该类问题的研究提供了一种新思路,有望实现深度强化学习智能决策在港口排产任务中的更广泛应用。 Intelligent decision scheduling can improve the operation efficiency of large ports,which is one of the important research directions for the implementation of artificial intelligence technology in the smart port scenario.This article studies the intelligent unloading scheduling tasks of coal terminals and abstracts them as a Markov sequence decision problem.A deep reinforcement learning model for this problem is established,and an improved D3QN algorithm is proposed to realize intelligent optimization of unloading scheduling decisions by considering the characteristics of high action space dimension and sparse feasible action in the model.The simulation results show that for the same set of random task sequences,the optimized scheduling strategy obviously improves the efficiency compared with the random strategy.At the same time,the trained scheduling strategy is directly applied to the randomly generated new task sequence,and the scheduling efficiency is improved by 5%~7%,which indicates that the optimization method has good generalization ability.In addition,with the increasing complexity of decision models,traditional heuristic optimization algorithms are faced with prominent problems such as difficult modeling and low solving efficiency.This article provides a new idea for studying this kind of problem,which is expected to realize the wider application of deep reinforcement learning-based intelligent decision-making in port scheduling tasks.
作者 秦保新 张羽霄 吴思锐 曹卫冲 李湛 Qin Baoxin;Zhang Yuxiao;Wu Sirui;Cao Weichong;Li Zhan(Guoneng(Tianjin)Port Co.,Ltd,Tianjin 300450,China;Research Institute of Intelligent Control and Systems,Harbin Institute of Technology,Harbin 150001,China;Department of Mathematics and Theory,Peng Cheng Laboratory,Shenzhen 518055,China)
出处 《系统仿真学报》 CAS CSCD 北大核心 2024年第3期770-781,共12页 Journal of System Simulation
基金 国家自然科学基金(62273122)。
关键词 码头卸车排产 调度策略优化 智能决策 深度强化学习 DuelingDoubleDQN算法 terminal unloading scheduling scheduling strategy optimization intelligent decision-making deep reinforcement learning Dueling Double DQN algorithm
  • 相关文献

参考文献6

二级参考文献44

  • 1周济.智能制造是“中国制造2025”主攻方向[J].企业观察家,2019,0(11):54-55. 被引量:96
  • 2王凌,郑洁,王晶晶.求解区间数分布式流水线调度的混合离散果蝇优化算法[J].控制与决策,2020,35(4):930-936. 被引量:19
  • 3李虎,霍佳震,陈瑶.一种求解船舶配载问题的混合遗传算法[J].工业工程与管理,2006,11(3):27-31. 被引量:8
  • 4李建忠,丁以中,王斌.集装箱堆场空间动态配置模型[J].交通运输工程学报,2007,7(3):50-55. 被引量:26
  • 5CARLO H J, VIS I F A, ROODBERGEN K J, Storage yard operations in container terminals: Literature over- view, trends, and research directions [J]. European Journal of Operational Research, 2014, 235 (2) :412 - 430.
  • 6NG W C, MAK K L. An effective heuristic for schedu- ling a yard crane to handle jobs with different ready times [J]. Engineering Optimization,2005,37 ( 8 ) : 867 - 877.
  • 7KUMAR M, OMKAR S N. Optimization of yard crane scheduling using particle swarm optimization with genetic algorithm operators (PSOGAO) [J]. Journal of Seientif-ic and Industrial Research, 2008, 67(5) :335 -339.
  • 8GUO Xi, HUANG Shell-ying, HSU Wen-jing, et al. Dy- namic yard crane dispatching in container terminals with predicted vehicle arrival information [J]. Advanced Engi- neering Informatics ,2011,25 ( 3 ) : 472 - 484.
  • 9VIS I F A, ROODBERGEN K J. Scheduling of container storage and retrieval [J]. Operations Research, 2009,57 (2) :456 - 467.
  • 10LI Wen-kai, WU Yong, PETERING M E H, et al. Discrete time model and algorithms for container yard crane sched- uling [J]. European Journal of Operational Research, 2009,198(1) :165 - 172.

共引文献51

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部