Joint optimization of parcel allocation and crowd routing for crowdsourced last-mile delivery

最后一英里(运输) 列生成 计算机科学 接头(建筑物) 最优化问题 车辆路径问题 运筹学 布线(电子设计自动化) 英里 比例(比率) 众包 时间范围 运输工程 数学优化 工程类 计算机网络 地理 算法 土木工程 数学 地图学 大地测量学 万维网
作者
Li Wang,Min Xu,Hu Qin
出处
期刊:Transportation Research Part B-methodological [Elsevier BV]
卷期号:171: 111-135 被引量:50
标识
DOI:10.1016/j.trb.2023.03.007
摘要

Urban last-mile delivery providers are facing more and more challenges with the explosive development of e-commerce. The advancement of smart mobile and communication technology in recent years has stimulated the development of a new business model of city logistics, referred to as crowdsourced delivery or crowd-shipping. In this paper, we investigate a form of crowdsourced last-mile delivery that utilizes the journeys of commuters/travelers (crowd-couriers) to deliver parcels from intermediate stations to customers. We consider a logistics service provider that jointly optimizes parcel allocation to intermediate stations and the delivery routing of the crowd-couriers. The joint optimization model gives rise to a new variant of the last-mile delivery problem. We propose a data-driven column generation algorithm to solve the problem based on a set-partitioning formulation. Additionally, a rolling-horizon approach is proposed to address large-scale instances. Extensive numerical experiments are conducted to verify the efficiency of our model and solution approach, as well as the significance of the joint optimization of parcel allocation and the delivery route of the crowdsourced last-mile delivery. The results show that our data-driven column generation algorithm can obtain (near-)optimal solutions for up to 200 parcels in significantly less time than the exact algorithm. For larger instances, the combination of the data-driven column generation algorithm and the rolling-horizon approach can obtain good-quality solutions for up to 1000 parcels in 15 min. Moreover, compared with crowd-courier route optimization only, the joint optimization of parcel allocation and crowd-routing reduces the total cost by 32%.
最长约 10秒,即可获得该文献文件

科研通智能强力驱动
Strongly Powered by AbleSci AI
科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
郗关塚发布了新的文献求助10
3秒前
3秒前
Nick发布了新的文献求助10
4秒前
可靠豌豆发布了新的文献求助10
5秒前
大模型应助杜晓倩采纳,获得10
5秒前
瑞恩完成签到,获得积分20
6秒前
Ava应助Dky采纳,获得10
6秒前
滕擎完成签到,获得积分10
6秒前
7秒前
MiniSolar完成签到,获得积分10
7秒前
okkk完成签到,获得积分10
7秒前
开朗的半鬼完成签到 ,获得积分10
8秒前
JUNJIU完成签到,获得积分10
8秒前
8秒前
molihuakai应助现代妙竹采纳,获得30
8秒前
8秒前
lili应助小鬼1004采纳,获得10
10秒前
wait完成签到,获得积分10
11秒前
斯文败类应助现代的代丝采纳,获得10
11秒前
Ronalsen完成签到 ,获得积分10
11秒前
mk完成签到 ,获得积分10
11秒前
12秒前
可靠豌豆完成签到,获得积分20
13秒前
含糊的幻波完成签到,获得积分10
13秒前
橙子完成签到,获得积分10
14秒前
zjh33应助小电驴采纳,获得10
14秒前
15秒前
15秒前
DOS完成签到 ,获得积分10
16秒前
孟祥合完成签到,获得积分10
17秒前
17秒前
Sky_Light发布了新的文献求助10
18秒前
深情安青应助默默的惜蕊采纳,获得10
19秒前
20秒前
20秒前
小二郎应助Nick采纳,获得10
21秒前
22秒前
杜晓倩发布了新的文献求助10
24秒前
核桃发布了新的文献求助20
25秒前
帅肚应助yan采纳,获得10
25秒前
高分求助中
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
HYDROLYSE ACIDE DE QUELQUES DIOXASPIROCYCLANES 1314
Essentials of Carbohydrate Chemistry and Biochemistry, 4th Edition 800
Navigating Normative Orders. Interdisciplinary Perspectives 800
1 Peter and Christ's Descent to the Dead in Its Early Christian Reception 700
Organizational Behavior 510
Management and the Arts 510
热门求助领域 (近24小时)
化学 材料科学 医学 生物 纳米技术 工程类 有机化学 化学工程 生物化学 计算机科学 内科学 物理 复合材料 催化作用 细胞生物学 无机化学 光电子学 物理化学 电极 基因
热门帖子
关注 科研通微信公众号,转发送积分 7746178
求助须知:如何正确求助?哪些是违规求助? 9294054
关于积分的说明 20223336
捐赠科研通 7326031
什么是DOI,文献DOI怎么找? 3308059
关于科研通互助平台的介绍 2460040
邀请新用户注册赠送积分活动 2319591