Crowdsourced last mile delivery: Collaborative workforce assignment

计算机科学 任务(项目管理) 最后一英里(运输) 禁忌搜索 移交 集合(抽象数据类型) 运筹学 质量(理念) 英里 计算机网络 工程类 人工智能 哲学 物理 程序设计语言 系统工程 认识论 天文
作者
Nada Elsokkary,Hadi Otrok,Shakti Singh,Rabeb Mizouni,Hassan Barada,Mohammed Omar
出处
期刊:Internet of things [Elsevier]
卷期号:22: 100692-100692 被引量:16
标识
DOI:10.1016/j.iot.2023.100692
摘要

In this paper, we propose a last mile delivery selection model using crowdsourced workers that optimizes the trade-off between cost, time, and workers' performance. Most of the current methods utilize either greedy worker–task assignments or a task-by-task basis selection to reach a sufficient worker–task assignment. However, a better trade-off between the distance traveled and delivery time can be further obtained by considering the quality of performance on the tasks as a whole rather than treating tasks individually. As a solution, we present a novel framework for last mile delivery which separates the routing and assignment aspects of the problem and solves the assignment problem by maximizing the overall quality of the delivery. The Quality of Service (QoS) is defined as a non-linear function of the number of allocated tasks, distance traveled, timeliness of the delivery, workers' reputation, and confidence in delivery completion. In the first step, the delivery tasks to be shipped from a single warehouse are clustered using k-medoids. The set of tasks in each cluster are to be delivered by the same worker. The shipping provider will send a truck to handover the corresponding parcels to each worker. Accordingly, the shortest route for the truck is computed using Tabu search, where the handover points to the potential workers are the centroids of the clusters. Tabu search is also used to compute the potential workers' routes from the handover point through all the tasks in the cluster. Finally, genetic algorithm is used to effectively solve the assignment problem where each worker is assigned to several neighboring tasks. The performance of the proposed assignment mechanism is evaluated and compared to greedy solutions with respect to the QoS as well as its components. The results show that the proposed algorithm achieves 100% task allocation ratio while outperforming greedy selections in terms of QoS. Moreover, it is able to increase confidence in task completion by 20.3% on average and prevent delays to the schedule of the truck.
最长约 10秒,即可获得该文献文件

科研通智能强力驱动
Strongly Powered by AbleSci AI
更新
大幅提高文件上传限制,最高150M (2024-4-1)

科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
刚刚
科研通AI2S应助lulu采纳,获得10
1秒前
科研通AI2S应助lulu采纳,获得10
1秒前
明亮小土豆完成签到,获得积分10
1秒前
lianliyou应助唐嘉宏采纳,获得10
2秒前
4秒前
4秒前
斯文败类应助jewel9采纳,获得10
5秒前
小椭冲冲冲完成签到,获得积分10
6秒前
刘宁发布了新的文献求助10
8秒前
9秒前
啦啦发布了新的文献求助10
10秒前
务实的菓完成签到 ,获得积分10
10秒前
守拙完成签到 ,获得积分10
11秒前
12秒前
12秒前
13秒前
13秒前
Aurora完成签到,获得积分10
13秒前
多多发布了新的文献求助10
14秒前
14秒前
16秒前
17秒前
jewel9发布了新的文献求助10
17秒前
Fxxkme发布了新的文献求助10
18秒前
dyk完成签到,获得积分10
18秒前
18秒前
19秒前
啦啦完成签到,获得积分10
20秒前
20秒前
NexusExplorer应助明亮忆秋采纳,获得10
21秒前
23秒前
852应助国家栋梁采纳,获得10
24秒前
怕黑黄豆完成签到,获得积分20
27秒前
27秒前
成佳策完成签到,获得积分20
27秒前
思量完成签到,获得积分10
28秒前
28秒前
传奇3应助自觉的月亮采纳,获得10
29秒前
桐桐应助Fxxkme采纳,获得10
29秒前
高分求助中
The ACS Guide to Scholarly Communication 2500
Microlepidoptera Palaearctica, Volumes 1 and 3 - 13 (12-Volume Set) [German] 1122
PraxisRatgeber Mantiden., faszinierende Lauerjäger. – Buch gebraucht kaufen 700
Mantiden - Faszinierende Lauerjäger – Buch gebraucht kaufen 700
Ожившие листья и блуждающие цветы. Практическое руководство по содержанию богомолов [Alive leaves and wandering flowers. A practical guide for keeping praying mantises] 500
Development of a new synthetic process for the synthesis of (S)-methadone and (S)- and (R)-isomethadone as NMDA receptor antagonists for the treatment of depression 500
A Dissection Guide & Atlas to the Rabbit 500
热门求助领域 (近24小时)
化学 医学 生物 材料科学 工程类 有机化学 生物化学 物理 内科学 纳米技术 计算机科学 化学工程 复合材料 基因 遗传学 催化作用 物理化学 免疫学 量子力学 细胞生物学
热门帖子
关注 科研通微信公众号,转发送积分 3093988
求助须知:如何正确求助?哪些是违规求助? 2745878
关于积分的说明 7587633
捐赠科研通 2397197
什么是DOI,文献DOI怎么找? 1271798
科研通“疑难数据库(出版商)”最低求助积分说明 615272
版权声明 598844