【摘要】 本文针对大型自营电商统一配送货物建立运费模型,使用最小分枝算法求出使该问题中的运费达到最小的策略。根据不同城市之间费用的差异,通过定义一个可优化量,将自营电商统一配送货物运费问题转化成一个最小分枝问题;然后利用最小分枝模型为此问题制定了最优的运输策略,并给出求解此类问题的一般算法—最小分枝算法;最后从数值上对不同的算法进行了对比,结果表明本文提出的算法是较优的。更多还原

【Abstract】 This paper establish a cost model for large self-run e-commerce uniform distribution of goods, using the minimum branching algorithm for which the cost to the policies of the minimum.According to the difference between the cost of different cities, the cost problem of self-run e-commerce in the process of distribution of goods will be made into a minimum branching problem;Then, the optimal transport policy is formulated by using the minimum branching model for this problem, and a general algorithm for solving this kind of problem is given;Finally, the comparison of different algorithms is carried out.The result shows that the algorithm proposed in this paper is superior.更多还原