用二叉树解决配送线路问题

Solve Distribution Routes Problem by Binary Tree

物流配送是物流中的核心环节,配送成本在整个物流过程费用中占有很大的比重,因此为了减少配送成本有必要对其配送路线进行合理优化。运用二叉树遍历的知识并结合节约算法的思想,将货物需求点作为叶子结点并适当增加一些需求量为零的叶子结点构造一种有特殊意义的二叉树,提出了一种运用这种特殊二叉树在满足车辆额定载货量的前提下寻求最优配送路线的方法,并通过实例证明了其正确性。

Logistic distribution is the key point of logistics and the distribution cost take a major portion in the whole logistics procedure. So in order to minimize the distribution cost, it is necessary to optimize the distribution routes. This paper is using the knowledge of binary tree traversal combined with saving algorithm, taking the demand node as the leaf node and add some zero demand nodes as leaf node to form a particular binary tree, putting forward a method based on this particular binary tree to search for the optimal distribution routes under the premise of rated loading capacity of vehicles, and demonstrated its correctness.