期刊文献+

基于改进DQN算法的考虑船舶配载图的翻箱问题研究

BRP Problem Considering Stowage Plan Based on Improved DQN Algorithm
下载PDF
导出
摘要 为了满足船舶配载图的要求,减少场桥翻箱次数,提高码头运行效率,对考虑船舶配载图的集装箱翻箱问题进行了研究。此问题是在传统集装箱翻箱问题的基础上,又考虑到船舶配载图对翻箱的影响。为了求解此问题的最小翻箱次数,设计了DQN算法进行求解,同时为了提高算法求解的性能,又在原算法的基础上设计了基于启发式算法的阈值和全新的奖励函数以改进算法。通过与其它文献中的实验结果进行对比,结果显示:在计算结果上,改进的DQN算法在各个算例上的结果均优于目前各个启发式算法的最优结果,并且规模越大,结果越好;在训练时间上,改进的DQN算法极大的优于未改进的DQN算法,并且规模越大,节省的时间也更显著。 In order to meet the requirements of ship stowage plans,reduce the number of crane movements,and enhance terminal operational efficiency,the block relocation problem(BRP)considering stowage plan was studied,which was based on the traditional BRP and also considered the impact of stowage plan on block relocation.To minimize the number of container movements for this problem,a DQN algorithm was designed for solving it.Meanwhile,in order to improve the solving performance of the algorithm,the threshold values based on heuristic algorithms and a new reward function were designed on the basis of original algorithm to improve the algorithm.By comparing with experimental results in other literature,the results show that in terms of computational results,the improved DQN algorithm outperforms the optimal results of current heuristic algorithms in all cases and the larger the scale,the better the results.Moreover,in terms of training time,the improved DQN algorithm significantly outperforms the unimproved one,and the larger the scale,the more significant the time saved.
作者 梁承姬 花跃 王钰 LIANG Chengji;HUA Yue;WANG Yu(Research Institute of Logistics Science and Engineering,Shanghai Maritime University,Shanghai 201306,China)
出处 《重庆交通大学学报(自然科学版)》 CAS CSCD 北大核心 2024年第9期43-49,77,共8页 Journal of Chongqing Jiaotong University(Natural Science)
基金 国家自然科学基金项目(71972128) 上海市青年科技英才杨帆计划项目(21YF1416400) 上海市青年科技启明星计划项目(21QB1404800)。
关键词 交通运输工程 海运 集装箱翻箱 船舶配载图 DQN算法 traffic and transportation engineering ocean shipping block relocation problem(BPR) stowage plan deep Q-network(DQN)algorithm
  • 相关文献

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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