Research on time-varying path optimization for multi-vehicle type fresh food logistics distribution considering energy consumption

Abstract

With the increasing demand for fresh food markets, refrigerated transportation has become an essential component of logistics operations. Currently, fresh food transportation frequently faces issues of high energy consumption and high costs, which are inconsistent with the development needs of the modern logistics industry. This paper addresses the optimization problem of multi-vehicle type fresh food distribution under time-varying conditions. It comprehensively considers the changes in road congestion at different times and the quality degradation characteristics of fresh goods during distribution. The objectives include transportation cost, dual carbon cost, and damage cost, subject to constraints such as delivery time windows and vehicle capacity. A piecewise function is used to depict vehicle speeds, proposing a dynamic urban fresh food logistics vehicle routing optimization method. Given the NP-hard nature of the problem, a hybrid Tabu Search (TS) and Genetic Algorithm (GA) approach is designed to compute an optimal solution. Comparison with TS and GA algorithm results shows that the TS-GA algorithm provides the best optimization efficiency and effectiveness for solving large-scale distribution problems. The results indicate that using the TS-GA algorithm to optimize a distribution network with one distribution center and 30 delivery points resulted in a total cost of CNY 12,934.02 and a convergence time of 16.3 s. For problems involving multiple vehicle types and multiple delivery points, the TS-GA algorithm reduces the overall cost by 2.94–7.68% compared to traditional genetic algorithms, demonstrating superior performance in addressing multi-vehicle, multi-point delivery challenges.