Time-dependent vehicle routing problem for fresh products with cross-docking and door assignment
FAN Hou-ming
CHEN Tian-lei
BAI Xue
REN Xiao-xue
Abstract：The vehicle routing problem with multi-door cross-docking is studied to reduce the logistics cost of mul-tiple varieties of fresh food and an algorithm is designed to optimize the vehicle transportation path.Considering joint distribution of multiple cross-docks,cross-docking operation,time window,fresh products damage,time-varying vehicle speed,energy consumption of trucks,establishing an optimization model which is aimed at minimizing the sum of vehicle dispatch cost,products damage cost,fuel cost,electricity cost,penalty cost and cross-docking operation cost.According to the characteristics of the problem,an adaptive large neighborhood search is designed to solve it.The algorithm selects op-erators based on performance and usage frequency to destroy and repair the feasible solutions.Solving multiple cases with different scales to verify the correctness of the model and the effectiveness of the algorithm.In the numerical experiments,we analyzed the total cost with different scales.In addition,the sensitivity analysis of vehicle speed and return back mode is performed to illustrate the necessity of the proposed problem to consider time-varying speed and joint distribution of mul-tiple cross-docks.The research results not only enrich the scene of fresh products distribution with cross-docking,expand the research on vehicle routing problem with cross-docking(VRPCD),but also provide a basis for logistics enterprises to formulate delivery plans.
Keywords：vehicle routing problem with multiple cross-docksadaptive large neighborhood search algorithmdoor assignmenttime-dependentfresh products
Publication Date：2025-05-30
Online Publishing Date：2025-08-15(First online date of this platform, not the publication date of the document)
Pages：12( 955-966 )