Carton Set Optimization in E-commerce Warehouses: A Case Study

IF 11.2 2区 管理学 Q1 MANAGEMENT Journal of Business Logistics Pub Date : 2020-10-07 DOI:10.1111/jbl.12255
Manjeet Singh, Ehsan Ardjmand
{"title":"Carton Set Optimization in E-commerce Warehouses: A Case Study","authors":"Manjeet Singh,&nbsp;Ehsan Ardjmand","doi":"10.1111/jbl.12255","DOIUrl":null,"url":null,"abstract":"<p>In this study, a three-stage methodology for carton set optimization in e-commerce warehouses is proposed and evaluated on three DHL Supply Chain warehouses. The methodology includes order cubing, carton grouping, and optimal carton set selection. A modified largest area fits first algorithm for order cubing is proposed. For optimal carton set selection, a genetic algorithm with a novel crossover strategy is introduced. The results show that the proposed carton set optimization approach can improve the shipping cost and carton utilization by 7% and 7.8%, and considerably improve the carbon footprint of the operations, even when the number of carton types is not changed.</p>","PeriodicalId":48090,"journal":{"name":"Journal of Business Logistics","volume":"41 3","pages":"222-235"},"PeriodicalIF":11.2000,"publicationDate":"2020-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1111/jbl.12255","citationCount":"6","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Business Logistics","FirstCategoryId":"91","ListUrlMain":"https://onlinelibrary.wiley.com/doi/10.1111/jbl.12255","RegionNum":2,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MANAGEMENT","Score":null,"Total":0}
引用次数: 6

Abstract

In this study, a three-stage methodology for carton set optimization in e-commerce warehouses is proposed and evaluated on three DHL Supply Chain warehouses. The methodology includes order cubing, carton grouping, and optimal carton set selection. A modified largest area fits first algorithm for order cubing is proposed. For optimal carton set selection, a genetic algorithm with a novel crossover strategy is introduced. The results show that the proposed carton set optimization approach can improve the shipping cost and carton utilization by 7% and 7.8%, and considerably improve the carbon footprint of the operations, even when the number of carton types is not changed.

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
电子商务仓库纸箱组优化:一个案例研究
在本研究中,提出了一种三阶段的电子商务仓库纸箱集优化方法,并对三个DHL供应链仓库进行了评估。该方法包括订单立方,纸箱分组和最佳纸箱集选择。提出了一种改进的最大面积拟合优先算法。为了优化纸箱集的选择,提出了一种新的交叉策略的遗传算法。结果表明,在不改变纸箱种类数量的情况下,所提出的纸箱组优化方法可使运输成本和纸箱利用率分别提高7%和7.8%,并显著改善操作的碳足迹。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
CiteScore
14.40
自引率
14.60%
发文量
34
期刊介绍: Supply chain management and logistics processes play a crucial role in the success of businesses, both in terms of operations, strategy, and finances. To gain a deep understanding of these processes, it is essential to explore academic literature such as The Journal of Business Logistics. This journal serves as a scholarly platform for sharing original ideas, research findings, and effective strategies in the field of logistics and supply chain management. By providing innovative insights and research-driven knowledge, it equips organizations with the necessary tools to navigate the ever-changing business environment.
期刊最新文献
Issue Information The Innovative Roles of Supply Chain Finance Platforms in Generating Competitive Advantage Is Your Supply Chain Breaking Down? Call AAA for Resilience Assistance Supply Chain Digitalization and Agility: How Does Firm Innovation Matter in Companies? How Robotics is Shaping Digital Logistics and Supply Chain Management: An Ongoing Call for Research
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1