Solution approaches for combining first-mile pickup and last-mile delivery in an e-commerce logistic network: A systematic literature review

M. Ranathunga, A. Wijayanayake, D. Niwunhella
{"title":"Solution approaches for combining first-mile pickup and last-mile delivery in an e-commerce logistic network: A systematic literature review","authors":"M. Ranathunga, A. Wijayanayake, D. Niwunhella","doi":"10.1109/scse53661.2021.9568349","DOIUrl":null,"url":null,"abstract":"Logistics is one of the primary areas of operation within cutting-edge supply chain operations. In the e-commerce supply chain also logistics operations play a vital part. The logistics operations must be controlled effectively and efficiently since they deal with the high-cost besides environmental impacts. In e-commerce logistics operations, first-mile and last-mile delivery operations are considered as the operations with the highest costs incurred. So, e-commerce service providers are interested in optimizing their first-mile and last-mile delivery operations. Though it is known that the integration of first-mile pickup and last-mile deliveries will minimize the cost of transportation, there are more practical concerns to be taken into account when combining the first-mile pickup and last-mile delivery operations. Capacitated Vehicle Routing Problem (CVRP) is discussed in the literature as a solution approach for this kind of problems. The objective of this study is to provide a comprehensive overview of the current CVRP related literature, including models, algorithmic solution approaches, objectives, and industrial applications, with a focus of identifying interesting study paths for the future to improve distribution in e-commerce logistics networks by combining first-mile pickup and last-mile delivery operations. The findings of the study have demonstrated that constraints and features of Vehicle Routing Problem with Backhauls are very attractive with today's e-commerce operations, and the majority of the cited publications employed approximation methods rather than precise algorithms to solve these types of models.","PeriodicalId":319650,"journal":{"name":"2021 International Research Conference on Smart Computing and Systems Engineering (SCSE)","volume":"46 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-09-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 International Research Conference on Smart Computing and Systems Engineering (SCSE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/scse53661.2021.9568349","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

Logistics is one of the primary areas of operation within cutting-edge supply chain operations. In the e-commerce supply chain also logistics operations play a vital part. The logistics operations must be controlled effectively and efficiently since they deal with the high-cost besides environmental impacts. In e-commerce logistics operations, first-mile and last-mile delivery operations are considered as the operations with the highest costs incurred. So, e-commerce service providers are interested in optimizing their first-mile and last-mile delivery operations. Though it is known that the integration of first-mile pickup and last-mile deliveries will minimize the cost of transportation, there are more practical concerns to be taken into account when combining the first-mile pickup and last-mile delivery operations. Capacitated Vehicle Routing Problem (CVRP) is discussed in the literature as a solution approach for this kind of problems. The objective of this study is to provide a comprehensive overview of the current CVRP related literature, including models, algorithmic solution approaches, objectives, and industrial applications, with a focus of identifying interesting study paths for the future to improve distribution in e-commerce logistics networks by combining first-mile pickup and last-mile delivery operations. The findings of the study have demonstrated that constraints and features of Vehicle Routing Problem with Backhauls are very attractive with today's e-commerce operations, and the majority of the cited publications employed approximation methods rather than precise algorithms to solve these types of models.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
电子商务物流网络中首英里提货与最后一英里配送相结合的解决方法:系统文献综述
物流是尖端供应链运作的主要领域之一。在电子商务供应链中,物流运作也起着至关重要的作用。由于物流作业不仅涉及环境影响,而且还涉及高成本,因此必须对其进行有效和高效的控制。在电子商务物流运营中,第一英里和最后一英里的配送业务被认为是成本最高的业务。因此,电子商务服务提供商对优化第一英里和最后一英里的配送业务很感兴趣。虽然众所周知,第一英里取货和最后一英里送货的整合将使运输成本最小化,但在将第一英里取货和最后一英里送货业务结合起来时,还有更多实际问题需要考虑。有能力车辆路径问题(Capacitated Vehicle Routing Problem, CVRP)是解决这类问题的一种方法。本研究的目的是提供当前CVRP相关文献的全面概述,包括模型、算法解决方法、目标和工业应用,重点是确定未来有趣的研究路径,通过结合第一英里取货和最后一英里交付操作来改善电子商务物流网络中的配送。研究结果表明,在当今的电子商务运营中,带有回程的车辆路径问题的约束和特征非常有吸引力,并且大多数引用的出版物采用近似方法而不是精确算法来解决这些类型的模型。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Reduce food crop wastage with hyperledger fabric-based food supply chain Identifying interrelationships of key success factors of third-party logistics service providers A decentralized social network architecture Estimation of the incubation period of COVID-19 using boosted random forest algorithm Temporal preferential attachment: Predicting new links in temporal social networks
×
引用
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