Branch-and-Price for the Capacitated Autonomous Vehicle Assisted Delivery Problem

车辆路径问题 计算机科学 数学优化 整数规划 运筹学 数学 布线(电子设计自动化) 计算机网络
作者
Rui Zhang
出处
期刊:Informs Journal on Computing
标识
DOI:10.1287/ijoc.2023.0177
摘要

In recent years, the exponential growth of package volumes has posed significant challenges for logistics networks, particularly in the realm of last-mile delivery. To mitigate costs while upholding service and delivery commitments, companies are increasingly investigating autonomous assisted delivery as a viable solution. In this paper, we study the Capacitated Autonomous Vehicle Assisted Delivery Problem, where an autonomous vehicle works in conjunction with a delivery person. The autonomous vehicle drops off the delivery person at designated locations, and the delivery person completes the deliveries (with a capacity constraint) on foot to the final addresses. Once the deliveries are completed, the vehicle picks up the delivery person and travels to the next reloading point. The goal is to decide on a route to serve all customers while minimizing the route completion time. We introduce an integer programming formulation with exponentially many variables and develop a branch-and-price approach. For generating promising columns, we present a tailored pulse algorithm to solve the pricing problem. Furthermore, by leveraging the structural properties of optimal solutions, we carefully design algorithmic enhancements, valid inequalities, and preprocessing steps to improve computational tractability. By conducting computational experiments based on instances derived from real-world data, we demonstrate the positive impact of these components. More importantly, we provide optimal certificates for 426 out of the 450 instances documented in the literature. Among the 100 instances in which driving could be slower than walking, we report solutions for the 40 largest instances for the first time. History: Accepted by David Alderson, Area Editor for Network Optimization. Supplemental Material: The software that supports the findings of this study is available within the paper and its Supplemental Information ( https://pubsonline.informs.org/doi/suppl/10.1287/ijoc.2023.0177 ) as well as from the IJOC GitHub software repository ( https://github.com/INFORMSJoC/2023.0177 ). The complete IJOC Software and Data Repository is available at https://informsjoc.github.io/ .
最长约 10秒,即可获得该文献文件

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

科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
啾星发布了新的文献求助10
刚刚
刚刚
量子星尘发布了新的文献求助10
1秒前
健忘惜海发布了新的文献求助10
2秒前
逍遥发布了新的文献求助10
4秒前
无问完成签到,获得积分10
5秒前
人抗破伤风免疫球蛋白完成签到 ,获得积分10
5秒前
runzhi完成签到,获得积分10
7秒前
研友_VZG7GZ应助健忘惜海采纳,获得10
8秒前
缥缈熊猫完成签到,获得积分20
8秒前
FashionBoy应助干净绮烟采纳,获得10
8秒前
纪凡祥完成签到,获得积分10
8秒前
罗大大完成签到 ,获得积分0
9秒前
浮游应助伊芷采纳,获得10
9秒前
氧泡泡发布了新的文献求助10
10秒前
10秒前
13秒前
13秒前
天马完成签到,获得积分20
14秒前
15秒前
量子星尘发布了新的文献求助10
16秒前
啾星完成签到,获得积分10
17秒前
17秒前
18秒前
西斯塔完成签到,获得积分20
18秒前
19秒前
19秒前
小黑完成签到,获得积分10
20秒前
阜睿发布了新的文献求助10
21秒前
21秒前
21秒前
汉堡包应助wenquan采纳,获得10
22秒前
flypipidan完成签到,获得积分10
22秒前
22秒前
orixero应助没名字采纳,获得10
23秒前
sky完成签到,获得积分10
24秒前
24秒前
圣诞节发布了新的文献求助10
25秒前
研友_Z7Xdl8发布了新的文献求助10
26秒前
ban完成签到,获得积分10
27秒前
高分求助中
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
The Social Work Ethics Casebook: Cases and Commentary (revised 2nd ed.).. Frederic G. Reamer 1070
Alloy Phase Diagrams 1000
Introduction to Early Childhood Education 1000
2025-2031年中国兽用抗生素行业发展深度调研与未来趋势报告 1000
List of 1,091 Public Pension Profiles by Region 891
Historical Dictionary of British Intelligence (2014 / 2nd EDITION!) 500
热门求助领域 (近24小时)
化学 材料科学 医学 生物 工程类 有机化学 生物化学 物理 纳米技术 计算机科学 内科学 化学工程 复合材料 物理化学 基因 遗传学 催化作用 冶金 量子力学 光电子学
热门帖子
关注 科研通微信公众号,转发送积分 5424683
求助须知:如何正确求助?哪些是违规求助? 4539082
关于积分的说明 14165073
捐赠科研通 4456131
什么是DOI,文献DOI怎么找? 2444042
邀请新用户注册赠送积分活动 1435140
关于科研通互助平台的介绍 1412483