Vehicle routing optimization for the mixed distribution of refrigerated and ambient products
This paper focuses on a new mixed distribution problem of cold-chain and normal-temperature products.In this problem,customers with multiple time windows in different congested areas are served by refrigerated and non-refrigerated vehicles.The goal is to minimize the total cost of distribution.A tabu search heuristic algorithm with two neighbor evaluation rules is proposed to solve the problem.The first evaluation rule considers an objective vector composed of several attributes of the solution,while the second one considers a penalty cost in addition to the objective vector.Computational experiments indicate that the tabu search algorithm with the second evaluation rule performs better than other proposed approaches,and cold chain mixed distribution mode can effectively reduce the total distribution cost.The proposed model and algorithm can help e-commerce enterprises build a new cold chain mixed distribution network with lower cost and higher quality.
mixed distributionvehicle routing problemtabu searchmulti-type fleet vehiclesmulti-time windows