A novel mathematical modeling approach for integrating a periodic vehicle routing problem and cross-docking system

IF 4.1 2区 工程技术 Q2 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS
Mostafa Asgharyar , Nima Farmand , Seyyed Nader Shetab-Boushehri
{"title":"A novel mathematical modeling approach for integrating a periodic vehicle routing problem and cross-docking system","authors":"Mostafa Asgharyar ,&nbsp;Nima Farmand ,&nbsp;Seyyed Nader Shetab-Boushehri","doi":"10.1016/j.cor.2025.107048","DOIUrl":null,"url":null,"abstract":"<div><div>To remain competitive in a globalized market, manufacturers must effectively respond to customer demands in various situations. In parallel, logistics companies have adopted cross-docking systems as a key component of lean supply chain management to handle high transportation volumes. By integrating this pivotal component in the supply chain, goods are efficiently distributed to retailers via cross-dock facilities. This article introduces, for the first time, an integrated framework for the periodic vehicle routing problem with cross-docking (PVRPCD) system between supplier and retailer locations. The goal is to optimize three key decisions: 1. Vehicle scheduling and routing for each period, 2. The loading and unloading quantities of goods at the cross-dock, and 3. The selection of a daily combination from periodic retailer demands to minimize the costs incurred by transportation and cross-docking operations. To formulate the PVRPCD, a novel mixed-integer linear programming (MILP) model is designed. Given the computational complexity of large-scale instances, a heuristic algorithm is designed to produce near-optimal initial solutions, which are then embedded into two metaheuristic algorithms: variable neighborhood search (VNS) and population-based variable neighborhood search (PBVNS). These algorithms incorporate four shaking and four local search operators to enhance solution quality and scalability. To validate the effectiveness of the metaheuristic algorithms, computational experiments are conducted using benchmark instances. The optimal solutions obtained via the CPLEX solver for small-scale instances serve as a baseline for comparison. The computational results illustrate that both algorithms effectively solve small-scale problems. Nevertheless, PBVNS consistently outperforms VNS in terms of solution quality, though it requires more computation time. Despite the increased solution time, the improvement in solution quality justifies the additional computational effort. Finally, sensitivity analyses on key PVRPCD parameters provide managerial insights for decision-makers, offering a profound understanding into the influence of model parameters on solution performance.</div></div>","PeriodicalId":10542,"journal":{"name":"Computers & Operations Research","volume":"180 ","pages":"Article 107048"},"PeriodicalIF":4.1000,"publicationDate":"2025-03-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computers & Operations Research","FirstCategoryId":"5","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0305054825000760","RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0

Abstract

To remain competitive in a globalized market, manufacturers must effectively respond to customer demands in various situations. In parallel, logistics companies have adopted cross-docking systems as a key component of lean supply chain management to handle high transportation volumes. By integrating this pivotal component in the supply chain, goods are efficiently distributed to retailers via cross-dock facilities. This article introduces, for the first time, an integrated framework for the periodic vehicle routing problem with cross-docking (PVRPCD) system between supplier and retailer locations. The goal is to optimize three key decisions: 1. Vehicle scheduling and routing for each period, 2. The loading and unloading quantities of goods at the cross-dock, and 3. The selection of a daily combination from periodic retailer demands to minimize the costs incurred by transportation and cross-docking operations. To formulate the PVRPCD, a novel mixed-integer linear programming (MILP) model is designed. Given the computational complexity of large-scale instances, a heuristic algorithm is designed to produce near-optimal initial solutions, which are then embedded into two metaheuristic algorithms: variable neighborhood search (VNS) and population-based variable neighborhood search (PBVNS). These algorithms incorporate four shaking and four local search operators to enhance solution quality and scalability. To validate the effectiveness of the metaheuristic algorithms, computational experiments are conducted using benchmark instances. The optimal solutions obtained via the CPLEX solver for small-scale instances serve as a baseline for comparison. The computational results illustrate that both algorithms effectively solve small-scale problems. Nevertheless, PBVNS consistently outperforms VNS in terms of solution quality, though it requires more computation time. Despite the increased solution time, the improvement in solution quality justifies the additional computational effort. Finally, sensitivity analyses on key PVRPCD parameters provide managerial insights for decision-makers, offering a profound understanding into the influence of model parameters on solution performance.

Abstract Image

一种集成周期性车辆路径问题和交叉对接系统的新型数学建模方法
为了在全球化的市场中保持竞争力,制造商必须在各种情况下有效地响应客户的需求。与此同时,物流公司已经采用交叉对接系统作为精益供应链管理的关键组成部分,以处理高运输量。通过将这一关键组成部分整合到供应链中,货物通过交叉码头设施有效地分发给零售商。本文首次提出了一个集成的框架,用于解决供应商和零售商之间具有交叉对接(PVRPCD)的周期性车辆路径问题。目标是优化三个关键决策:2.各时段车辆调度及路线;2 .货物在交叉码头的装卸数量;从定期零售商中选择每日组合,要求将运输和交叉对接操作所产生的成本降至最低。为了构造PVRPCD,设计了一种新的混合整数线性规划(MILP)模型。考虑到大规模实例的计算复杂性,设计了一种启发式算法来产生接近最优的初始解,然后将其嵌入到两种元启发式算法中:可变邻域搜索(VNS)和基于种群的可变邻域搜索(PBVNS)。这些算法结合了四个抖动算子和四个局部搜索算子来提高解的质量和可扩展性。为了验证元启发式算法的有效性,使用基准实例进行了计算实验。通过CPLEX求解器获得的小规模实例的最优解可作为比较的基线。计算结果表明,这两种算法都能有效地解决小规模问题。尽管如此,PBVNS在解决方案质量方面始终优于VNS,尽管它需要更多的计算时间。尽管增加了解决时间,但解决质量的改进证明了额外的计算工作是合理的。最后,对关键PVRPCD参数的敏感性分析为决策者提供了管理见解,使他们能够深入了解模型参数对解决方案绩效的影响。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Computers & Operations Research
Computers & Operations Research 工程技术-工程:工业
CiteScore
8.60
自引率
8.70%
发文量
292
审稿时长
8.5 months
期刊介绍: Operations research and computers meet in a large number of scientific fields, many of which are of vital current concern to our troubled society. These include, among others, ecology, transportation, safety, reliability, urban planning, economics, inventory control, investment strategy and logistics (including reverse logistics). Computers & Operations Research provides an international forum for the application of computers and operations research techniques to problems in these and related fields.
×
引用
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学术文献互助群
群 号:481959085
Book学术官方微信