配送计划的优化编制方法

讨论了在时间、距离和载重量等多种约束条件下，编制配送计划的优化方法。先给出配送问题的数学模型，并设计了一个带时间和距离约束条件的启发式算法来求解该模型，求得问题的近似解；然后再采用分枝定界法得到配送问题的最优解：最后，考查近似解与最优解在总的运行距离的相对误差，以此检验这个近似解的有效性。

Optimized Method of Distribution Planning

The paper studies the optimized method of distribution planning with restrictions of time, distance and weight. First, it brings forward a maths model for distribution problem and designs a heuristic algorithm with time and distance restrictions to solve the model ao as to get the approximate result; Then it applies Branch and Bound Approach to gain the optimized result of distribution problem; Finally, it checks the relative error of total driving distances between the approximate result and the optimized result to check the validity of the approximate result.