The Vehicle Routing Optimization With Lateral Transshipment Policy And Fuzzy Demand

This paper studies on the problem of unbalanced sales in the operation of chain stores.In this problem,the accurate value of supply-demand matching relationship between customer points can't be predetermined;the backlog which results from the poor sales in some stores can be reduced through the round trip between customer points of the distribution vehicle.The decisions of the supplying and demanding matching and the fuzzy demand vehicle routing are involved for solving this problem.This problem is a complex derivative of the vehicle routing problem in multi-distribution centers.And it is commonly found in manufacturing,transportation,and e-commerce logistics.Different from the vehicle routing problem of multi-distribution centers,each service object in this problem can be treated as both a distribution center and a customer point.Based on the high complexity and less attention of this problem,this paper first analyzed the background of the demand for chain commodities' mutual delivery,and introduced the theoretical basis and research status of the problem.On this basis,with the goal of the lowest operating cost of the chain headquarters,a fuzzy chance constraint model which based on the credible measure theory was constructed with the considering the fuzzy demand.The model is a static vehicle routing problem model with five characteristics of multiple vehicles,multiple products,multiple batches,customers can be multiple visits and fuzzy demands.According to the characteristics of the model,this paper designed a genetic tabu algorithm that combined the advantages of genetic algorithm and tabu algorithm.And explores the influence of algorithm parameters on the running results through multiple experiments on different scale examples.This paper also verifies the reliability of the model and the effectiveness of the algorithm.The experimental results show that the genetic tabu algorithm is accurate for small-scale problems and stable for large-scale problems.The algorithm performance is better than the comparison algorithm,which can provide the solution to the problem and matches the model of the article.Finally,this paper combines the actual case to study the influence of the dispatcher preference index on the operating cost,and analyzes the reason for the operating cost changes with the index.