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 , Nima Farmand , 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.
期刊介绍:
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.