Learning to multi-vehicle cooperative bin packing problem via sequence-to-sequence policy network with deep reinforcement learning model

装箱问题 序列(生物学) 强化学习 计算机科学 箱子 启发式 数学优化 包装问题 算法 人工智能 数学 遗传学 生物
作者
Ran Tian,Chunming Kang,Jiaming Bi,Zhongyu Ma,Yanxing Liu,Saisai Yang,Fang‐Fang Li
出处
期刊:Computers & Industrial Engineering [Elsevier BV]
卷期号:177: 108998-108998 被引量:7
标识
DOI:10.1016/j.cie.2023.108998
摘要

In the logistics bin packing scenario with only rear bin doors, the packing sequence of items determines the utilization of vehicle packing space, but there is relatively little research on optimizing the packing sequence of items. Therefore, this article focuses on the bin packing sequence problem in the multi-vehicle cooperative bin packing problem(MVCBPP) and proposes a deep reinforcement learning model based on the sequence-to-sequence policy network with deep reinforcement learning model(S2SDRL). Firstly, the sequence-to-sequence neural networks model is constructed, which determines the packing probability of all items. The items will be packed by combining the bidirectional LSTM model and the attention module to construct the encoder and decoder. Secondly, the bin packing strategy of the items is obtained by the constructed reinforcement learning packing framework. Finally, the Seq2Seq policy network is updated and optimized by the policy gradient method with a baseline to obtain the current optimal packing strategy. In several bin packing scenarios, S2SDRL improves the average vehicle space utilization by more than 4.0% compared with the traditional packing algorithm, and the forward computation time of the model is much smaller than that of the traditional heuristic algorithm, so the model also has more realistic application value. Ablation experiments also confirm the effectiveness of the modules in the S2SDRL model for optimization of the packing order. The sensitivity analysis shows the model's some stability when the input data changes.

科研通智能强力驱动
Strongly Powered by AbleSci AI
科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
小二郎应助lyla采纳,获得10
刚刚
1秒前
1秒前
11完成签到 ,获得积分10
2秒前
海马回发布了新的文献求助10
3秒前
大杨完成签到,获得积分10
3秒前
wisteria发布了新的文献求助10
3秒前
科研通AI6.4应助文林宝贝采纳,获得10
4秒前
5秒前
wwliu199完成签到,获得积分10
6秒前
amey发布了新的文献求助10
6秒前
6秒前
一见喜完成签到,获得积分10
6秒前
6秒前
ping发布了新的文献求助10
9秒前
9秒前
陈进完成签到,获得积分10
9秒前
liubowen发布了新的文献求助20
9秒前
bp2018完成签到,获得积分10
10秒前
11秒前
11秒前
慕青应助文献多多采纳,获得10
11秒前
12秒前
明理的秀发布了新的文献求助10
12秒前
13秒前
13秒前
13秒前
思源应助科研通管家采纳,获得10
13秒前
领导范儿应助科研通管家采纳,获得10
14秒前
温温应助科研通管家采纳,获得10
14秒前
张欢馨应助科研通管家采纳,获得10
14秒前
英俊的铭应助科研通管家采纳,获得10
14秒前
斯文败类应助科研通管家采纳,获得10
14秒前
Hello应助科研通管家采纳,获得10
14秒前
共享精神应助科研通管家采纳,获得10
15秒前
斯文败类应助科研通管家采纳,获得10
15秒前
15秒前
15秒前
脑洞疼应助科研通管家采纳,获得10
15秒前
Loki应助科研通管家采纳,获得20
15秒前
高分求助中
Markov Chain Monte Carlo 10000
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
Common Foundations of American and East Asian Modernisation: From Alexander Hamilton to Junichero Koizumi 5000
Pediatric Dermoscopy Trichoscopy & Onychoscopy 2030
Matrix Methods in Data Mining and Pattern Recognition Second Edition 610
Handbuch Trainingswissenschaft – Trainingslehre 500
Additive Manufacturing Design and Applications (ASM Handbook, Volume 24A) 500
热门求助领域 (近24小时)
化学 材料科学 医学 生物 纳米技术 工程类 有机化学 化学工程 生物化学 计算机科学 内科学 物理 复合材料 催化作用 细胞生物学 无机化学 光电子学 物理化学 电极 基因
热门帖子
关注 科研通微信公众号,转发送积分 7576776
求助须知:如何正确求助?哪些是违规求助? 9156350
关于积分的说明 19588291
捐赠科研通 7160548
什么是DOI,文献DOI怎么找? 3265116
关于科研通互助平台的介绍 2430202
邀请新用户注册赠送积分活动 2255726