A branch‐and‐price‐and‐cut algorithm for the truck‐drone routing problem with simultaneously delivery and pickup

皮卡 卡车 无人机 计算机科学 收入 布线(电子设计自动化) 启发式 车辆路径问题 运筹学 数学优化 业务 工程类 汽车工程 数学 计算机网络 会计 人工智能 图像(数学) 生物 遗传学
作者
Dongwei Li,Joshua Ignatius,Dujuan Wang,Yunqiang Yin,T.C.E. Cheng
出处
期刊:Naval Research Logistics [Wiley]
卷期号:71 (2): 241-285 被引量:5
标识
DOI:10.1002/nav.22151
摘要

Abstract Increasing environmental concerns and e‐commerce has attracted a growing focus on reverse logistics that not only delivers some goods to customers but also picks up other goods from customers. To achieve cost‐efficient and fast deliveries, integrating drones into the delivery and pickup services provides a competitive advantage, which however increases the operational challenges. We consider a truck‐drone routing problem with simultaneous delivery and pickup, where each truck carries a set of heterogeneous drones. Each truck can simultaneously perform its own delivery and pickup, and serve as an intermediate movable depot from which multiple drones can be dispatched to serve customers when the truck arrives at a customer, and the truck must wait until all the drones return. The energy consumption of drones is considered during their flights. All the delivery services must be performed, whereas the pickup services are optional with certain rewards. The objective is to find the synthetic‐routes of the truck‐drone combinations so as to minimize the sum of the assignment cost and the transport cost of the trucks and drones minus the total pickup revenue. To solve the problem, we devise a tailored branch‐and‐price‐and‐cut algorithm incorporating a specialized two‐stage bidirectional labeling algorithm to solve the challenging pricing problem. To enhance the efficiency of the algorithm, we use the subset‐row inequalities to tighten the lower bound, and apply some heuristic pricing strategies to quickly solve the pricing problem. We perform extensive numerical studies to assess the performance of the developed algorithm, analyze the merit of the truck‐drone cooperative service mode over the truck‐only service mode and the superiority of the configuration with heterogeneous drones, and ascertain the impacts of the key model parameters to generate managerial insights. We also show how our model would perform should it be used for the medical supply delivery and pickup in Shenzhen, China.
最长约 10秒,即可获得该文献文件

科研通智能强力驱动
Strongly Powered by AbleSci AI
更新
PDF的下载单位、IP信息已删除 (2025-6-4)

科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
gxzsdf完成签到 ,获得积分10
刚刚
我思故我在完成签到,获得积分10
2秒前
3秒前
阿帕奇完成签到 ,获得积分10
6秒前
Conner完成签到 ,获得积分10
7秒前
量子星尘发布了新的文献求助10
10秒前
zhang完成签到 ,获得积分10
11秒前
wol007完成签到 ,获得积分10
13秒前
123完成签到 ,获得积分10
14秒前
Justtry完成签到 ,获得积分20
14秒前
naiyouqiu1989完成签到,获得积分10
16秒前
沿途有你完成签到 ,获得积分10
16秒前
花生四烯酸完成签到 ,获得积分10
18秒前
科科通通完成签到,获得积分10
18秒前
WYK完成签到 ,获得积分10
21秒前
21秒前
学海行舟完成签到 ,获得积分10
25秒前
黑眼圈完成签到 ,获得积分10
28秒前
幸福的羿完成签到 ,获得积分10
29秒前
量子星尘发布了新的文献求助10
30秒前
霍明轩完成签到 ,获得积分10
39秒前
游艺完成签到 ,获得积分10
42秒前
量子星尘发布了新的文献求助10
43秒前
是盐的学术号吖完成签到 ,获得积分10
44秒前
空2完成签到 ,获得积分0
49秒前
烂漫的从彤完成签到,获得积分10
49秒前
Wang完成签到 ,获得积分20
49秒前
小心翼翼完成签到 ,获得积分10
50秒前
Manzia完成签到,获得积分10
55秒前
小丸子和zz完成签到 ,获得积分10
59秒前
1分钟前
在水一方应助灵巧的傲柏采纳,获得10
1分钟前
Dr.Tang完成签到 ,获得积分10
1分钟前
swordshine完成签到,获得积分10
1分钟前
量子星尘发布了新的文献求助10
1分钟前
1分钟前
1分钟前
herpes完成签到 ,获得积分0
1分钟前
Heart_of_Stone完成签到 ,获得积分10
1分钟前
1分钟前
高分求助中
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
网络安全 SEMI 标准 ( SEMI E187, SEMI E188 and SEMI E191.) 1000
Inherited Metabolic Disease in Adults: A Clinical Guide 500
计划经济时代的工厂管理与工人状况(1949-1966)——以郑州市国营工厂为例 500
INQUIRY-BASED PEDAGOGY TO SUPPORT STEM LEARNING AND 21ST CENTURY SKILLS: PREPARING NEW TEACHERS TO IMPLEMENT PROJECT AND PROBLEM-BASED LEARNING 500
The Pedagogical Leadership in the Early Years (PLEY) Quality Rating Scale 410
Why America Can't Retrench (And How it Might) 400
热门求助领域 (近24小时)
化学 材料科学 医学 生物 工程类 有机化学 生物化学 物理 纳米技术 计算机科学 内科学 化学工程 复合材料 物理化学 基因 催化作用 遗传学 冶金 电极 光电子学
热门帖子
关注 科研通微信公众号,转发送积分 4613016
求助须知:如何正确求助?哪些是违规求助? 4018011
关于积分的说明 12436990
捐赠科研通 3700338
什么是DOI,文献DOI怎么找? 2040716
邀请新用户注册赠送积分活动 1073470
科研通“疑难数据库(出版商)”最低求助积分说明 957104