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

求助全文
约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学术官方微信