Research On The Fresh Fruit And Vegetable Produce Distribution Optimization Under Cross-docking

In recent years,the transaction scale of China’s online retail market has gradually expanded.With the appearances of the conceptions of New Retail and Unbounded Retail,consumers have been prompted to another online consumption peak,especially in the category of fresh produce.The consumption ideas and goals of consumers are gradually developing in the direction of high quality and differentiation,and the demand for fresh product is exploding.Logistics is an important support and guarantee for the successful operation of e-commerce platform.Though the logistics infrastructure service facilities are continually improving,there exists many flaws such as long storage time and many times of transfer in the mode of fresh distribution of the current fresh logistics enterprises.Under these defects,the damage rate of fresh produce is as high as 25%～40%.Such a high damage rate reduces consumer stickiness,and limits the further development of the e-commerce platfonns and fresh logistics enterprises.Consequently,how to reduce the damage rate and innovate mode to output the excellent logistics scheme is an urgent problem for the fresh e-commerce platforms and fresh logistics companies.Cross-docking distribution is a kind of distribution mode and often used in retail enterprises and automobile manufacturing.It has many special advantages such as short supply chain time and zero inventory.This paper considers the vehicle full load rate,and applies the direct and cross-docking distribution mode into the commodity distribution of the fresh logistics enterprises.Moreover,the location of the cross-docking center and the vehicle routing optimization are exported as the logistics scheme,and the optimization problem of the location and routing of the direct and cross-docking for fresh produce is deeply researched.At the beginning of this paper,the research background and significance of the problem are analyzed.This paper looks for the breakthrough points and innovation points through domestic and foreign research results,and determines the research direction and methodology.Then the traditional fresh delivery mode and direct and cross-docking distribution mode are expounded respectively.Meanwhile,the optimization problem classification of location and routing and related algorithms are introduced,and the constraint programming different from the traditional mathematical planning thought is also briefly introduced.Through the introductions,a foundation is built for the subsequent model and algorithm design.Based on the detailed analysis of the main factors,cost composition and influence factors,the model for the location and routing of the direct and cross-docking for fresh produce is built,and exact algorithm and heuristic algorithm are designed to solve the model.Among the algorithms,the exact algorithm is CPLEX solution based on the constraint programming,while the heuristic algorithm is based on the G-BBO solution.In the part of example analysis,based on the real operation data of a fresh logistics enterprise in Shanghai,this paper compares the traditional fresh distribution mode with the direct and cross-docking fresh distribution mode,and then compares the correctness of the mathematical model with the performance of the algorithm.The final result of the example proves that the cross-docking distribution mode for fresh produce could effectively reduce the fresh loss and the total operational costs.Besides,the result proves that the designed algorithm is effective and provides an important optimization approach for the real-scale problem.The main innovations in this paper are as follows:(1)This paper is innovative in the distribution mode,and applies the direct and the cross-docking distribution in the distribution of the fresh produce to reduce the fresh loss and the total operational costs.(2)This paper builds the optimization model of the location and routing of the direct and the cross-docking for fresh produce based on the problem analysis,and makes a correct abstract and description for the problem essence.(3)In the part of the exact algorithm design,the constraint programming is used to narrow the search space of CPLEX feasible solutions,and speeds up the solution of exact algorithm to some extent.(4)In the part of heuristic algorithm,with the use of the greedy algorithm,this paper optimizes from narrowing the initial solution search space and repairing damaged habitat,respectively.The convergence speed of the algorithm is accelerated,and the solution quality is improved.(5)With the example to verify the advantages and disadvantages of these two distribution modes,the algorithm performances are compared through the running results of five algorithms in order to draw conclusions.