An exact algorithm for unpaired pickup and delivery vehicle routing problem with multiple commodities and multiple visits

皮卡 车辆路径问题 布线(电子设计自动化) 计算机科学 算法 数学优化 人工智能 数学 计算机网络 图像(数学)
作者
Dongyang Xu,Lu Zhen,Hing Kai Chan,Jianjiang Wang,Ligang Cui
出处
期刊:Transportation Research Part C-emerging Technologies [Elsevier BV]
卷期号:160: 104488-104488 被引量:16
标识
DOI:10.1016/j.trc.2024.104488
摘要

This paper addresses a new multi-commodity unpaired pickup and delivery vehicle routing problem in which each vehicle is allowed to visit each customer more than once for both pickup and delivery of each commodity. It is a complex variant of the classical capacitated vehicle routing problem and comes from resource transfer among different plants in a distributed manufacturing environment. Notably, the pairing decisions of pickup and delivery for each commodity and the routing decisions among customers are interdependent, and they need to be made simultaneously and collaboratively. Firstly, a mixed integer programming model is developed, and then new valid inequalities are derived to improve the linear programming relaxation. Afterwards, a branch-and-cut algorithm is proposed by exploring different branching strategies and tailored separation algorithms. Computational results based on real-case instances from an automobile manufacturing company demonstrate that the costs are considerably reduced by considering the multiple visits compared to the single visit of each customer. In addition, our proposed branch-and-cut algorithm outperforms a manual solution method adopted by the company in practice and two solution methods in the literature. Furthermore, two adaptations of our branch-and-cut algorithm also perform better than two state-of-the-art algorithms in solving two closely-related problems in terms of solution quality and computation time. Sensitivity analyses with respect to vehicle capacity, vehicle duration, and vehicle speed are conducted to derive several valuable managerial insights.
最长约 10秒,即可获得该文献文件

科研通智能强力驱动
Strongly Powered by AbleSci AI
科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
Happyocean发布了新的文献求助10
刚刚
沧海月明完成签到,获得积分10
2秒前
诸葛烤鸭发布了新的文献求助10
2秒前
3秒前
橙神完成签到,获得积分10
3秒前
3秒前
cdercder的应助被nissy采纳,获得10
3秒前
4秒前
5秒前
干就完完成签到,获得积分20
5秒前
5秒前
明天太好完成签到,获得积分10
5秒前
yi发布了新的文献求助10
5秒前
隐形曼青的应助被Present采纳,获得30
6秒前
hyper完成签到 ,获得积分10
6秒前
6秒前
123发布了新的文献求助10
6秒前
6秒前
大模型的应助被LLL采纳,获得10
6秒前
6秒前
7秒前
7秒前
碎觉觉发布了新的文献求助30
7秒前
7秒前
顺利毕业发布了新的文献求助10
7秒前
8秒前
Moonber发布了新的文献求助10
8秒前
Linus完成签到,获得积分10
9秒前
千空发布了新的文献求助10
10秒前
10秒前
10秒前
干就完发布了新的文献求助10
10秒前
钟梓袄发布了新的文献求助10
10秒前
任我完成签到,获得积分10
10秒前
10秒前
Chelseacyh发布了新的文献求助10
11秒前
11秒前
孟滴滴的应助被颜凡桃采纳,获得10
11秒前
11秒前
领导范儿的应助被灰灰采纳,获得10
11秒前
高分求助中
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
拉伸高分子熔体中缠结行为的模拟和小角中子散射研究 1700
The World Atlas of Wine 9th edition 1000
奈特基础组织学:配套组织病理学(第4版)(Netter's Essential Histology With Correlated Histopathology) 800
八旗制度の研究 600
Improving the wear resistance of vehicle gear oil by oil soluble LaF3 nanoparticles and typical additives of gear oil 500
Boundaries and Bodhisattvas 500
热门求助领域 (近24小时)
化学 材料科学 医学 生物 纳米技术 计算机科学 工程类 有机化学 化学工程 生物化学 物理 复合材料 内科学 催化作用 光电子学 人工智能 细胞生物学 无机化学 物理化学 数学
热门帖子
关注 科研通微信公众号,转发送积分 8183204
求助须知:如何正确求助?哪些是违规求助? 9572434
关于积分的说明 21825655
捐赠科研通 7779988
什么是DOI,文献DOI怎么找? 3433852
关于科研通互助平台的介绍 2558060
邀请新用户注册赠送积分活动 2480148