Heterogeneous multi-depot collaborative vehicle routing problem

IF 5.8 1区 工程技术 Q1 ECONOMICS
Qihuan Zhang , Ziteng Wang , Min Huang , Yang Yu , Shu-Cherng Fang
{"title":"Heterogeneous multi-depot collaborative vehicle routing problem","authors":"Qihuan Zhang ,&nbsp;Ziteng Wang ,&nbsp;Min Huang ,&nbsp;Yang Yu ,&nbsp;Shu-Cherng Fang","doi":"10.1016/j.trb.2022.03.004","DOIUrl":null,"url":null,"abstract":"<div><p>Collaborative vehicle routing of multiple logistics providers is an important component of horizontal logistic collaboration that generates economic and societal benefits. Existing research on collaborative vehicle routing is limited to the homogeneous setting where the logistics providers transport the same product. To better address the need of a general modeling framework and fast computational methods for the growth of collaboration among logistics providers carrying various products, we investigate a heterogeneous multi-depot collaborative vehicle routing problem (HMCVRP) in this paper. The key operational and computational challenge of realizing the collaborative route planning is to properly select transfer points for product transshipment between vehicles of different depots. We propose a Benders-based branch-and-cut algorithm with the technique of combinatorial Benders’ cuts to solve a mixed-integer programming formulation of HMCVRP. Numerical experiments indicate that the proposed algorithm significantly outperforms the CPLEX solver using the commonly adopted big-M transformation-based method. Additional computational study further reveals the importance of the locations of depots and having a well-designed cost savings allocation mechanism in practice.</p></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"160 ","pages":"Pages 1-20"},"PeriodicalIF":5.8000,"publicationDate":"2022-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"13","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Transportation Research Part B-Methodological","FirstCategoryId":"5","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0191261522000467","RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"ECONOMICS","Score":null,"Total":0}
引用次数: 13

Abstract

Collaborative vehicle routing of multiple logistics providers is an important component of horizontal logistic collaboration that generates economic and societal benefits. Existing research on collaborative vehicle routing is limited to the homogeneous setting where the logistics providers transport the same product. To better address the need of a general modeling framework and fast computational methods for the growth of collaboration among logistics providers carrying various products, we investigate a heterogeneous multi-depot collaborative vehicle routing problem (HMCVRP) in this paper. The key operational and computational challenge of realizing the collaborative route planning is to properly select transfer points for product transshipment between vehicles of different depots. We propose a Benders-based branch-and-cut algorithm with the technique of combinatorial Benders’ cuts to solve a mixed-integer programming formulation of HMCVRP. Numerical experiments indicate that the proposed algorithm significantly outperforms the CPLEX solver using the commonly adopted big-M transformation-based method. Additional computational study further reveals the importance of the locations of depots and having a well-designed cost savings allocation mechanism in practice.

异构多车场协同车辆路径问题
多物流供应商协同车辆路径是横向物流协作的重要组成部分,能够产生经济效益和社会效益。现有的协同车辆路径研究仅限于物流供应商运输相同产品的同质设置。为了更好地解决运输不同产品的物流供应商之间协作增长对通用建模框架和快速计算方法的需求,本文研究了一个异构多仓库协同车辆路径问题(HMCVRP)。实现协同路线规划的关键操作和计算挑战是合理选择不同车场车辆之间的产品转运转运点。针对HMCVRP的混合整数规划公式,提出了一种基于Benders的分支切割算法。数值实验表明,该算法明显优于基于大m变换的CPLEX求解器。另外的计算研究进一步揭示了仓库选址和设计良好的成本节约分配机制在实践中的重要性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Transportation Research Part B-Methodological
Transportation Research Part B-Methodological 工程技术-工程:土木
CiteScore
12.40
自引率
8.80%
发文量
143
审稿时长
14.1 weeks
期刊介绍: Transportation Research: Part B publishes papers on all methodological aspects of the subject, particularly those that require mathematical analysis. The general theme of the journal is the development and solution of problems that are adequately motivated to deal with important aspects of the design and/or analysis of transportation systems. Areas covered include: traffic flow; design and analysis of transportation networks; control and scheduling; optimization; queuing theory; logistics; supply chains; development and application of statistical, econometric and mathematical models to address transportation problems; cost models; pricing and/or investment; traveler or shipper behavior; cost-benefit methodologies.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信