基于众包拍卖的时间紧迫、预算有限的最后一英里交付框架

IF 7.4 1区 管理学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS Information Processing & Management Pub Date : 2024-09-30 DOI:10.1016/j.ipm.2024.103888
Esraa Odeh , Shakti Singh , Rabeb Mizouni , Hadi Otrok
{"title":"基于众包拍卖的时间紧迫、预算有限的最后一英里交付框架","authors":"Esraa Odeh ,&nbsp;Shakti Singh ,&nbsp;Rabeb Mizouni ,&nbsp;Hadi Otrok","doi":"10.1016/j.ipm.2024.103888","DOIUrl":null,"url":null,"abstract":"<div><div>This work addresses the problem of Last Mile Delivery (LMD) under time-critical and budget-constrained environments. Given the rapid growth of e-commerce worldwide, LMD has become a primary bottleneck to the efficiency of delivery services due to several factors, including travelling distance, service cost, and delivery time. Existing works mainly target optimizing travelled distance and maximizing gained profit; however, they do not consider time-critical and budget-limited tasks. The deployment of UAVs and the development of crowdsourcing platforms have provided a range of solutions to advance performance in LMD frameworks, as they offer many crowdworkers at varying locations ready to perform tasks instead of having a single point of departure. This work proposes a Hybrid, Crowdsourced, Auction-based LMD (HCA-LMD) framework with a dynamic allocation mechanism for optimized delivery of time-sensitive and budget-limited tasks. The proposed framework allocates tasks to workers as soon as they are submitted, given their urgency level and dropoff location, while considering the price, rating, and location of available workers. This work was compared against two benchmarks to assess the framework’s performance in dynamic environments in terms of on-time deliveries, average delay, and profit. Extensive simulation results showed an outstanding performance of the proposed state-of-the-art LMD framework by accomplishing almost 92% on-time deliveries under varying time- and budget-constrained scenarios, outperforming the first benchmark in the on-time allocation rate by fulfiling an additional 24% of the tasks the benchmark failed, with around 50% drop in average delay time and up to x5.8 gained profit when compared against the second benchmark.</div></div>","PeriodicalId":50365,"journal":{"name":"Information Processing & Management","volume":"62 1","pages":"Article 103888"},"PeriodicalIF":7.4000,"publicationDate":"2024-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Crowdsourced auction-based framework for time-critical and budget-constrained last mile delivery\",\"authors\":\"Esraa Odeh ,&nbsp;Shakti Singh ,&nbsp;Rabeb Mizouni ,&nbsp;Hadi Otrok\",\"doi\":\"10.1016/j.ipm.2024.103888\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>This work addresses the problem of Last Mile Delivery (LMD) under time-critical and budget-constrained environments. Given the rapid growth of e-commerce worldwide, LMD has become a primary bottleneck to the efficiency of delivery services due to several factors, including travelling distance, service cost, and delivery time. Existing works mainly target optimizing travelled distance and maximizing gained profit; however, they do not consider time-critical and budget-limited tasks. The deployment of UAVs and the development of crowdsourcing platforms have provided a range of solutions to advance performance in LMD frameworks, as they offer many crowdworkers at varying locations ready to perform tasks instead of having a single point of departure. This work proposes a Hybrid, Crowdsourced, Auction-based LMD (HCA-LMD) framework with a dynamic allocation mechanism for optimized delivery of time-sensitive and budget-limited tasks. The proposed framework allocates tasks to workers as soon as they are submitted, given their urgency level and dropoff location, while considering the price, rating, and location of available workers. This work was compared against two benchmarks to assess the framework’s performance in dynamic environments in terms of on-time deliveries, average delay, and profit. Extensive simulation results showed an outstanding performance of the proposed state-of-the-art LMD framework by accomplishing almost 92% on-time deliveries under varying time- and budget-constrained scenarios, outperforming the first benchmark in the on-time allocation rate by fulfiling an additional 24% of the tasks the benchmark failed, with around 50% drop in average delay time and up to x5.8 gained profit when compared against the second benchmark.</div></div>\",\"PeriodicalId\":50365,\"journal\":{\"name\":\"Information Processing & Management\",\"volume\":\"62 1\",\"pages\":\"Article 103888\"},\"PeriodicalIF\":7.4000,\"publicationDate\":\"2024-09-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Information Processing & Management\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0306457324002474\",\"RegionNum\":1,\"RegionCategory\":\"管理学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Information Processing & Management","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0306457324002474","RegionNum":1,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

摘要

这项研究解决的是时间紧迫和预算有限环境下的最后一英里配送(LMD)问题。鉴于全球电子商务的迅猛发展,受旅行距离、服务成本和交付时间等多种因素的影响,最后一英里配送已成为影响配送服务效率的主要瓶颈。现有研究主要以优化运输距离和最大化收益为目标,但没有考虑时间紧迫和预算有限的任务。无人机的部署和众包平台的发展为提高 LMD 框架的性能提供了一系列解决方案,因为它们在不同地点提供了许多准备执行任务的众包者,而不是只有一个出发点。本研究提出了一种基于拍卖的混合众包 LMD(HCA-LMD)框架,该框架具有动态分配机制,可优化时间敏感型和预算有限型任务的交付。根据任务的紧急程度和下达地点,提议的框架会在任务提交后立即将任务分配给工人,同时考虑可用工人的价格、等级和地点。这项工作与两个基准进行了比较,从准时交货、平均延迟和利润方面评估了该框架在动态环境中的性能。广泛的仿真结果表明,所提出的最先进的 LMD 框架表现出色,在时间和预算受限的不同情况下,完成了近 92% 的准时交付,在准时分配率方面优于第一个基准,额外完成了 24% 基准未能完成的任务,与第二个基准相比,平均延迟时间减少了约 50%,利润增加了高达 x5.8。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Crowdsourced auction-based framework for time-critical and budget-constrained last mile delivery
This work addresses the problem of Last Mile Delivery (LMD) under time-critical and budget-constrained environments. Given the rapid growth of e-commerce worldwide, LMD has become a primary bottleneck to the efficiency of delivery services due to several factors, including travelling distance, service cost, and delivery time. Existing works mainly target optimizing travelled distance and maximizing gained profit; however, they do not consider time-critical and budget-limited tasks. The deployment of UAVs and the development of crowdsourcing platforms have provided a range of solutions to advance performance in LMD frameworks, as they offer many crowdworkers at varying locations ready to perform tasks instead of having a single point of departure. This work proposes a Hybrid, Crowdsourced, Auction-based LMD (HCA-LMD) framework with a dynamic allocation mechanism for optimized delivery of time-sensitive and budget-limited tasks. The proposed framework allocates tasks to workers as soon as they are submitted, given their urgency level and dropoff location, while considering the price, rating, and location of available workers. This work was compared against two benchmarks to assess the framework’s performance in dynamic environments in terms of on-time deliveries, average delay, and profit. Extensive simulation results showed an outstanding performance of the proposed state-of-the-art LMD framework by accomplishing almost 92% on-time deliveries under varying time- and budget-constrained scenarios, outperforming the first benchmark in the on-time allocation rate by fulfiling an additional 24% of the tasks the benchmark failed, with around 50% drop in average delay time and up to x5.8 gained profit when compared against the second benchmark.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Information Processing & Management
Information Processing & Management 工程技术-计算机:信息系统
CiteScore
17.00
自引率
11.60%
发文量
276
审稿时长
39 days
期刊介绍: Information Processing and Management is dedicated to publishing cutting-edge original research at the convergence of computing and information science. Our scope encompasses theory, methods, and applications across various domains, including advertising, business, health, information science, information technology marketing, and social computing. We aim to cater to the interests of both primary researchers and practitioners by offering an effective platform for the timely dissemination of advanced and topical issues in this interdisciplinary field. The journal places particular emphasis on original research articles, research survey articles, research method articles, and articles addressing critical applications of research. Join us in advancing knowledge and innovation at the intersection of computing and information science.
期刊最新文献
Unsupervised Adaptive Hypergraph Correlation Hashing for multimedia retrieval Enhancing robustness in implicit feedback recommender systems with subgraph contrastive learning Domain disentanglement and fusion based on hyperbolic neural networks for zero-shot sketch-based image retrieval Patients' cognitive and behavioral paradoxes in the process of adopting conflicting health information: A dynamic perspective Study of technology communities and dominant technology lock-in in the Internet of Things domain - Based on social network analysis of patent network
×
引用
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