亲爱的研友该休息了!由于当前在线用户较少,发布求助请尽量完整地填写文献信息,科研通机器人24小时在线,伴您度过漫漫科研夜!身体可是革命的本钱,早点休息,好梦!

EXPRESS: A Machine Learning Approach to Solve the E-commerce Box-Sizing Problem

尺寸 计算机科学 运筹学 数学优化 工业工程 运营管理 人工智能 业务 经济 数学 工程类 艺术 视觉艺术
作者
Shanthan Kandula,Debjit Roy,Kerem Akartunalı
出处
期刊:Production and Operations Management [Wiley]
标识
DOI:10.1177/10591478241282249
摘要

E-commerce packages are notorious for their inefficient usage of space. More than one-quarter volume of a typical e-commerce package comprises air and filler material. The inefficient usage of space significantly reduces the transportation and distribution capacity increasing the operational costs. Therefore, designing an optimal set of packaging box sizes is crucial for improving efficiency. We present the first learning-based framework to determine the optimal packaging box sizes. In particular, we propose a three-stage optimization framework that combines unsupervised learning, reinforcement learning, and tree search to design box sizes. The package optimization problem is formulated into a sequential decision-making task called the box-sizing game. A neural network agent is then designed to play the game and learn heuristic rules to solve the problem. In addition, a tree-search operator is developed to improve the performance of the learned networks. When benchmarked with company-based optimization formulation and two alternate optimization models, we find that our ML-based approach can effectively solve large-scale problems within a stipulated time. We evaluated our model on real-world datasets supplied by a large e-commerce platform. The framework is currently adopted by a large e-commerce company across its 28 fulfillment centers, which is estimated to save the company about 7.1 million USD annually. In addition, it is estimated that paper consumption will be reduced by 2080 metric tons and greenhouse gas emissions by 1960 metric tons annually. The presented optimization framework serves as a decision support tool for designing packaging boxes at large e-commerce warehouses.
最长约 10秒,即可获得该文献文件

科研通智能强力驱动
Strongly Powered by AbleSci AI
科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
王梦若完成签到,获得积分10
4秒前
如梦似幻完成签到 ,获得积分10
6秒前
molihuakai应助jsw采纳,获得10
20秒前
38秒前
41秒前
43秒前
外向不愁发布了新的文献求助10
44秒前
36hours发布了新的文献求助10
46秒前
49秒前
jsw发布了新的文献求助10
53秒前
丢丢第完成签到,获得积分10
53秒前
GanQ完成签到 ,获得积分10
1分钟前
1分钟前
1分钟前
coco发布了新的文献求助30
1分钟前
1分钟前
1分钟前
cds完成签到,获得积分10
1分钟前
什么时候能毕业完成签到,获得积分10
1分钟前
GanQ发布了新的文献求助10
1分钟前
1分钟前
cdercder应助科研通管家采纳,获得10
1分钟前
1分钟前
adm0616完成签到,获得积分10
1分钟前
科研通AI6.2应助coco采纳,获得10
1分钟前
yg28完成签到,获得积分0
1分钟前
lixinglei应助彩色白桃采纳,获得20
1分钟前
coco完成签到,获得积分10
2分钟前
2分钟前
2分钟前
星辰大海应助bull9518采纳,获得10
2分钟前
coco发布了新的文献求助10
2分钟前
2分钟前
2分钟前
GanQ发布了新的文献求助10
2分钟前
思源应助可爱多采纳,获得20
2分钟前
2分钟前
虫子完成签到,获得积分10
2分钟前
3分钟前
3分钟前
高分求助中
Markov Chain Monte Carlo 10000
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
Common Foundations of American and East Asian Modernisation: From Alexander Hamilton to Junichero Koizumi 5000
悉尼大学博士学位论文,题目:Modelling and testing of one-sided stitched laminated composites. 作者:Kristopher P. Plain 700
Matrix Methods in Data Mining and Pattern Recognition Second Edition 610
Understanding Octavia Butler 500
Data book on fatigue strength of metallic materials 500
热门求助领域 (近24小时)
化学 材料科学 医学 生物 纳米技术 工程类 有机化学 化学工程 生物化学 计算机科学 内科学 物理 复合材料 催化作用 细胞生物学 无机化学 光电子学 物理化学 电极 基因
热门帖子
关注 科研通微信公众号,转发送积分 7564924
求助须知:如何正确求助?哪些是违规求助? 9145161
关于积分的说明 19554035
捐赠科研通 7151787
什么是DOI,文献DOI怎么找? 3262486
关于科研通互助平台的介绍 2428754
邀请新用户注册赠送积分活动 2252294