容器(类型理论)
重新安置
计算机科学
强化学习
院子
基线(sea)
人工智能
领域(数学分析)
序列(生物学)
分布式计算
运筹学
程序设计语言
机械工程
数学分析
海洋学
物理
数学
量子力学
生物
工程类
遗传学
地质学
作者
Fengwei Liu,Te Ye,Zizhen Zhang
标识
DOI:10.1007/978-3-031-36822-6_24
摘要
Container Relocation Problem (CRP) is one of the most important and fundamental problems in the terminal’s operations. Given a specified layout of the container yard with all the container retrieval priorities, CRP aims to identify an ideal container movement sequence so as to minimize the total number of container rehandling operations. In this paper, we are the first to propose a deep reinforcement learning method to tackle the problem. It adopts a dynamic attention model to respond to the changes of the layout. The long short-term memory and multi-head attention layers are introduced to better extract the features of stacks. We use a policy gradient algorithm with rollout baseline to train the model. The experiments demonstrate that our method can solve the problem effectively compared with other classic approaches. We conclude that the deep reinforcement learning approach has a great potential in solving CRP, as it can find desirable solution without using much expert domain knowledge.
科研通智能强力驱动
Strongly Powered by AbleSci AI