Study On Distribution Route Optimization Of Convenience Store In A Chain Enterprise

Chain convenience store enterprise developing rapidly in recent years,China has a number of brand chain convenience stores.Due to the characteristics of the chain of convenience stores distribution basically every day,so the distribution costs occupy most of the costs of chain convenience stores,and distribution line rationalization plays a crucial role on the cost of chain convenience stores,but also it is the key point to the local chain convenience store brands compete with foreign convenience store brands.Currently the problem of distribution of chain convenience stores is still VRP problem in essence.Based on the review of VRP problems at home and abroad,this paper analyzes that the distribution of chain convenience stores belongs to large Research on Scale VRP Problems by searching the existing research results,relevant policies,theories and related case studies.Based on the distribution status and demand of chain convenience stores,this paper puts forward a solution to the problem of chain distribution in convenience store chain,which is to divide the distribution area and then optimize the route to solve the optimization of distribution route for chain convenience stores.This paper compares a variety of algorithms solving the problem of path optimization.The k-means clustering algorithm with simple principle,optimized iterative function and fast convergence speed is selected.Combining with An-colony algorithm to solve the optimization problem of chain convenience store delivery route,which has a distributed positive feedback computing mechanism and the robustness of solving the problem,Based on the disadvantage that the k value of k-means clustering algorithm is difficult to be selected,the paper proposes that the optimal k value is determined and the distribution area is divided by using the cross-validation of the contour coefficient index and the square error index in the group.At the same time,The parameter setting is discussed.By contrasting the simulation experiment,the range of parameter setting of the ant colony algorithm is roughly determined and used to solve the VRP problem.In the process of ant colony algorithm,the idea of saving algorithm is also applied.based on the above method,making A chain convenience store as the study of distribution routes optimization.First,with analyzing the status quo of the A-chain convenience store distribution,we can found that there are some problems such as unreasonable delivery route arrangement,long transportation route.Secondly,aim at reducing delivery cost and improving distribution efficiency,building convenience store delivery route optimization mathematical model,and using the improved K-k-means clustering algorithm to divide the distribution area,the chain 193 convenience stores are divided into 42,122,29 convenience stores in three categories.On this basis,using the ant colony algorithm which has determined the range of parameters to optimize the distribution route of each area and get the optimized route;Finally,this paper suggest the safeguard measures to rationalize the distribution route of convenience store in A Chain Store.After the implementation of the distribution line optimization program,A chain can effectively reduce transportation costs and improve distribution efficiency.The program also has certain reference value for the distribution route optimization of other chain stores.